A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
Authors:
- 1 September 2004
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 31 (10) , 1727-1751
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Scheduling job families about an unrestricted common due date on a single machineInternational Journal of Production Research, 1997
- A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due dateEuropean Journal of Operational Research, 1997
- The weighted common due date single machine scheduling problem revisitedComputers & Operations Research, 1996
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due DateOperations Research, 1991
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due DateOperations Research, 1991
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- Single-machine scheduling to minimize absolute deviation of completion times from a common due dateNaval Research Logistics (NRL), 1989
- Minimizing mean absolute deviation of completion times about a common due dateNaval Research Logistics Quarterly, 1986
- Single‐ and multiple‐processor models for minimizing completion time varianceNaval Research Logistics Quarterly, 1986
- Minimizing the average deviation of job completion times about a common due dateNaval Research Logistics Quarterly, 1981