A binary branch and bound algorithm to minimize maximum scheduling cost
Authors:
- Charu ChandraCCCharu Chandra
- Zhixin LiuZLZhixin Liu
- Jun HeJHJun He
- Toni RuohonenTRToni Ruohonen
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Job shop scheduling with setup times, deadlines and precedence constraintsJournal of Scheduling, 2008
- A branch and bound method for the job-shop problem with sequence-dependent setup timesAnnals of Operations Research, 2007
- Scheduling Problems with Two Competing AgentsOperations Research, 2004
- Guided Local Search with Shifting Bottleneck for Job Shop SchedulingManagement Science, 1998
- A block approach for single-machine scheduling with release dates and due datesEuropean Journal of Operational Research, 1986
- Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence ConstraintsOperations Research, 1983
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Sequencing with due‐dates and early start times to minimize maximum tardinessNaval Research Logistics Quarterly, 1974