Scheduling with a common due-window: Polynomially solvable cases

Authors:
Gur Mosheiov;Assaf Sarig
Affiliations:
Department of Statistics and School of Business Administration, The Hebrew University, Jerusalem 91905, Israel;Department of Statistics and School of Business Administration, The Hebrew University, Jerusalem 91905, Israel
Venue:
Information Sciences: an International Journal
Year:
2010

Citing 6
Cited 2

Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Operations Research
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness

Journal of Scheduling
Parallel Processor Scheduling Problems with Optimal Due Interval Determination

ENC '04 Proceedings of the Fifth Mexican International Conference in Computer Science
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

Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments

Information Sciences: an International Journal
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs

Information Sciences: an International Journal

Quantified Score

Hi-index	0.08

Visualization

Abstract

The single machine scheduling problem to minimize maximum weighted absolute deviations of job completion times from a common due-date, is known to be NP-hard. However, two special cases have been shown to have polynomial time solutions: the case of unit processing time jobs, and the case of due-date assignment for a given job sequence. We extend both cases to a setting of a common due-window. We show that the unit-job problem includes 12 different sub-cases, depending on the size and location of the (given) due-window. Scheduling and due-window assignment for a given job sequence is solved for a single machine, for parallel identical machines and for flow-shops. For each of the above cases, an appropriate special-structured linear program is presented.