Journal ArticleDOI
On the minimization of completion time variance with a bicriteria extension
TLDR
It is shown that the dynamic programming solution is easy to extend to a bicriteria version of the problem in which it is desired to simultaneously minimize the mean completion time and a fully polynomial approximation scheme is proposed.Abstract:
We discuss a single-machine scheduling problem where the objective is to minimize the variance of job completion times. To date, the problem has not been solved in polynomial time. This paper presents a dynamic programming algorithm that is pseudopolynomial in complexity. We also propose a fully polynomial approximation scheme and derive a lower bound that is useful in its implementation. Furthermore, we show that the dynamic programming solution is easy to extend to a bicriteria version of the problem in which it is desired to simultaneously minimize the mean completion time.read more
Citations
More filters
Journal ArticleDOI
A survey of the state-of-the-art of common due date assignment and scheduling research
TL;DR: A unified framework of the common due date assignment and scheduling problems in the deterministic case is provided by surveying the literature concerning the models involving single machine and parallel machines by finding an optimal value of thecommon due date and the related optimal schedule.
Book ChapterDOI
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
TL;DR: This work focuses on deterministic machine scheduling for which it is assumed that all data that define a problem instance are known with certainty.
Journal ArticleDOI
Newton's Method for Multiobjective Optimization
TL;DR: An extension of Newton's method for unconstrained multiobjective optimization (multicriteria optimization) that is locally superlinear convergent to optimal points and uses a Kantorovich-like technique.
Journal ArticleDOI
Completion time variance minimization on a single machine is difficult
TL;DR: In this paper it is proved that the CTV problem is NP-hard.
Journal ArticleDOI
Due date assignment and scheduling: Slk, TWK and other due date assignment models
TL;DR: In this paper, the authors provide a review of the results in this field (mainly of the last ten years) for the due date determination models where due dates are defined depending on the processing times (common slack due dates, total-work-content or processing-plus-wait due dates) or on the jobs' positions in the schedule.
References
More filters
Journal ArticleDOI
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date
TL;DR: In this article, the authors consider the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late.
Journal ArticleDOI
Minimizing Variation of Flow Time in Single Machine Systems
TL;DR: This paper addresses the problem of n jobs to be scheduled on a single machine in such a way that flow time variation is minimized and a heuristic method for scheduling is proposed.
Journal ArticleDOI
Variance Minimization in Single Machine Sequencing Problems
Alan G. Merten,Mervin E. Muller +1 more
TL;DR: While the two mean performance measures attain their minimums at the same job sequence, it is shown that the sequence that minimizes the variance of flow-time is antithetical to the sequenceThat minimizesThe variance of waiting-time, and the minimum values of the two variance measures are equal.
Journal ArticleDOI
Simultaneous minimization of mean and variation flow time and waiting in single machine systems
TL;DR: This paper considers bicriterion scheduling problems involving job completion times and job waiting times in a nonpreemptive single machine environment and presents an efficient algorithm for minimizing the variation of waiting time.