Naval Research Logistics (NRL) · 1988 · 104 citations · 5 references
Mathematical ProgrammingEngineeringComputational ComplexityOperations ResearchSequence-dependent Processing TimesSingle MachineMaximum Completion TimeSystems EngineeringDiscrete MathematicsParallel ComputingCombinatorial OptimizationJob SchedulerScheduling (Computing)Computer ScienceScheduling ProblemProduction SchedulingScheduling (Production Processes)Parallel ProgrammingLower Bounds
In this article we consider the problem of minimizing the maximum completion time of a sequence of n jobs on a single machine. Nonzero ready times and sequence-dependent processing times are allowed. Upper bounds, lower bounds, and dominance criteria are proposed and exploited in a branch-and-bound algorithm. Computational results are given.
5
Introduction to Sequencing and Scheduling
A. J. Clewett · Journal of the Operational Research Society · 1977 · 861 citations