Group sequencing around a common due date

Authors:
T.C. Edwin Cheng;Mikhail Y. Kovalyov;C. T. Ng;S. S. Lam
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Faculty of Economics, Belarusian State University, Minsk, Belarus and United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;School of Business & Administration, The Open University of Hong Kong, Homantin, Hong Kong
Venue:
Discrete Optimization
Year:
2008

Citing 6
Cited 2

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
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
The complexity of scheduling job families about a common due date

Operations Research Letters

Single-machine group scheduling with resource allocation and learning effect

Computers and Industrial Engineering
Group scheduling and job-dependent due window assignment based on a common flow allowance

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence independent setup time precedes the processing of each group. All jobs have a common fixed due date, which can be either unrestrictively large or restrictively small. The objective is to minimize the total weighted earliness-tardiness. Properties of optimal solutions are established, and dynamic programming algorithms are derived to solve several special cases of this problem. Computational experiments show that the algorithms can easily solve problems with 500 groups of jobs and each group has 10 to 50 jobs on a standard PC.