An algorithm for solving the job-shop problem
Management Science
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
Scheduling with release dates on a single machine to minimize total weighted completion time
Discrete Applied Mathematics
A time indexed formulation of non-preemptive single machine scheduling problems
Mathematical Programming: Series A and B
A branch and bound procedure to minimize mean absolute lateness on a single processor
Computers and Operations Research
Constraint-Based Scheduling
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
INFORMS Journal on Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
INFORMS Journal on Computing
The One-Machine Problem with Earliness and Tardiness Penalties
Journal of Scheduling
Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability
INFORMS Journal on Computing
Preemption in single machine earliness/tardiness scheduling
Journal of Scheduling
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Journal of Scheduling
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
INFORMS Journal on Computing
An exact algorithm for single-machine scheduling without machine idle time
Journal of Scheduling
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
Operations Research Letters
Operations Research Letters
Computers and Operations Research
A hybrid heuristic approach for single machine scheduling with release times
Computers and Operations Research
| Hi-index | 0.00 |
This paper proposes an efficient exact algorithm for the general single-machine scheduling problem where machine idle time is permitted. The algorithm is an extension of the authors' previous algorithm for the problem without machine idle time, which is based on the SSDP (Successive Sublimation Dynamic Programming) method. We first extend our previous algorithm to the problem with machine idle time and next propose several improvements. Then, the proposed algorithm is applied to four types of single-machine scheduling problems: the total weighted earliness-tardiness problem with equal (zero) release dates, that with distinct release dates, the total weighted completion time problem with distinct release dates, and the total weighted tardiness problem with distinct release dates. Computational experiments demonstrate that our algorithm outperforms existing exact algorithms and can solve instances of the first three problems with up to 200 jobs and those of the last problem with up to 80 jobs.