Abstract
The problem of minimizing the makespan on one machine with possible dependencies between jobs is considered. We enlarge the notion of precedence constraint by considering a minimal duration between the start times of each pair of dependent jobs. We propose an exact algorithm where this duration is taken into account. This algorithm is based on Carlier's algorithm [2], closely related to that of McMahon and Florian [10], for the One-Machine Sequencing (OMS) problem with independent jobs. Computational results are reported showing the efficiency of our procedure.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
