The complexity of scheduling job families about a common due date

Authors:
S. T. Webster
Affiliations:
Department of Operations & Information Management, School of Business, University of Wisconsin-madison, 975 University Avenue, Graïïnger Hall, Madison, WI 53706-1323, USA
Venue:
Operations Research Letters
Year:
1997

Citing 7
Cited 11

Sequencing with earliness and tardiness penalties: a review

Operations Research
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

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

Operations Research
New bounds for the identical parallel processor weighted flow time problem

Management Science
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Note on Parallel Machine Scheduling with Batch Setup Times

Operations Research

On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties

Computers and Operations Research
Machine scheduling with earliness, tardiness and non-execution penalties

Computers and Operations Research
Earliness/tardiness scheduling with a common due date and family setups

Computers and Industrial Engineering
Heuristic methods for the identical parallel machine flowtime problem with set-up times

Computers and Operations Research
Earliness-tardiness scheduling with setup considerations

Computers and Operations Research
Simulated annealing and genetic algorithm for unrelated parallel machine scheduling considering set-up times

International Journal of Computer Applications in Technology
Metaheuristic for parallel machines scheduling with resource-assignable sequence dependent setup times

Proceedings of the 13th annual conference on Genetic and evolutionary computation
An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times

Computers & Mathematics with Applications
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal
Group sequencing around a common due date

Discrete Optimization
Scheduling job families on non-identical parallel machines with time constraints

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Family scheduling problems are characterized by a setup time structure where setups are only required between jobs from different families. We consider the problem of scheduling job families on parallel machines to minimize weighted deviation about a common due date. Various special cases of this problem have been considered in the literature. This note summarizes known complexity results and introduces new complexity results. We show that the total earliness/tardiness problem is unary NP-hard when the number of machines and families are arbitrary, thus generalizing an earlier result and answering a longstanding open question in the literature.