A note on a due-date assignment on a two-machine flow-shop

Authors:
Motty Birman;Gur Mosheiov
Affiliations:
Department of Statistics, School of Business Administration, The Hebrew University, Mount Scopus, Jerusalem 91905, Israel;Department of Statistics, School of Business Administration, The Hebrew University, Mount Scopus, Jerusalem 91905, Israel
Venue:
Computers and Operations Research
Year:
2004

Citing 3
Cited 9

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Heuristics for multimachine scheduling problems with earliness and tardiness costs

Management Science
A common due-date assignment problem on parallel identical machines

Computers and Operations Research

Due date assignments and scheduling a single machine with a general earliness/tardiness cost function

Computers and Operations Research
Optimal due date assignment in multi-machine scheduling environments

Journal of Scheduling
Minmax scheduling problems with a common due-window

Computers and Operations Research
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Discrete Applied Mathematics
Optimal due date assignment and resource allocation in a group technology scheduling environment

Computers and Operations Research
Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

Computers and Industrial Engineering
Two due date assignment problems in scheduling a single machine

Operations Research Letters
Scheduling with due date assignment under special conditions on job processing

Journal of Scheduling
Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We address a due-date assignment and scheduling problem in a two-machine flow-shop setting. Our objective is to find both the job schedule and the common due-date which minimize maximum earliness, tardiness and due-date costs. We introduce an efficient (O(n2 log n)) solution, based on repetitive use of the well-known Johnson Algorithm.