Optimal common due-data with limited completion time deviation
Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Computers and Operations Research
Scheduling with a common due-window: Polynomially solvable cases
Information Sciences: an International Journal
Scheduling Algorithms
A fuzzy due-date bargainer for the make-to-order manufacturingsystems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Soft computing for multicustomer due-date bargaining
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Soft Due Window Assignment and Scheduling on Parallel Machines
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Due window scheduling for parallel machines
Mathematical and Computer Modelling: An International Journal
Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.07 |
We study problems of scheduling n jobs on m identical parallel machines, in which a common due window has to be assigned to all jobs. If a job is completed within the due window, then it incurs no scheduling cost. Otherwise, an earliness or tardiness cost is incurred. The job completion times as well as the due window location and size are integer valued decision variables. The objective is to find a job schedule as well as location and size of the due window such that a sum of costs associated with job earliness, job tardiness and due window location and size is minimized. The costs are arbitrary nondecreasing and job independent functions. We establish a number of properties of optimal solutions and derive dynamic programming algorithms, which are pseudopolynomial if the number of machines is a constant. The single machine case, in which the due window size cost is a discretely convex or concave nondecreasing function and all the other cost functions are linear, is shown to be polynomially solvable.