A note on a due-date assignment on a two-machine flow-shop
Authors:
- 1 March 2004
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 31 (3) , 473-480
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A survey of the state-of-the-art of common due date assignment and scheduling researchEuropean Journal of Operational Research, 2002
- A common due-date assignment problem on parallel identical machinesComputers & Operations Research, 2001
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due dateEuropean Journal of Operational Research, 2001
- Minimizing tardy jobs in a flowshop with common due dateEuropean Journal of Operational Research, 2000
- On the complexity of two-machine flowshop problems with due date related objectivesEuropean Journal of Operational Research, 1998
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costsNaval Research Logistics (NRL), 1997
- One-Processor Scheduling with Symmetric Earliness and Tardiness PenaltiesMathematics of Operations Research, 1988
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness PenaltiesOperations Research, 1978
- Optimal Single-Machine Scheduling with Earliness and Tardiness PenaltiesOperations Research, 1977
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954