Jackson's semi-preemptive scheduling on a single machine

Authors:
Anis Gharbi;Mohamed Labidi
Affiliations:
Princess Fatimah Al-Nijriss Research Chair for Advanced Manufacturing Technologies, Department of Industrial Engineering, College of Engineering, King Saud University, PO Box 800, Riyadh 11421, Sa ...;Combinatorial Optimization Research Group - ROI, Ecole Polytechnique de Tunisie, BP 743, 2078 La Marsa, Tunisia
Venue:
Computers and Operations Research
Year:
2010

Citing 11
Cited 0

The shifting bottleneck procedure for job shop scheduling

Management Science
An algorithm for solving the job-shop problem

Management Science
A practical use of Jackson's preemptive schedule for solving the job shop problem

Annals of Operations Research
Jackson's rule for single-machine scheduling: making a good heuristic better

Mathematics of Operations Research
An approximation algorithm for a single-machine scheduling problem with release times and delivery times

Discrete Applied Mathematics
A branch and bound algorithm for the job-shop scheduling problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Minimizing maximum promptness and maximum lateness on a single machine

Mathematics of Operations Research
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times

Journal of Scheduling
Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication

Journal of Scheduling
Search tree based approaches for parallel machine scheduling

Computers and Operations Research
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose an effective improvement of the well-known Jackson's preemptive schedule lower bound for the single machine scheduling problem with heads and tails. The semi-preemptive scheduling concept roughly consists in reducing the preemption impact by constraining some particular job parts to be processed in reduced time intervals. The impact of semi-preemptive scheduling is twofold: it yields a lower bound which dominates the preemptive one, and enables more effective adjustments of the heads and tails. Our experimental study revealed that suitably embedding our procedure within Carlier's algorithm makes feasible to solve all of the hard instances which could not be solved by its original variant.