THE ONE-MACHINE SEQUENCING PROBLEM WITH DEPENDENT JOBS

Authors
DAUZEREPERES S
Citation
S. Dauzereperes, THE ONE-MACHINE SEQUENCING PROBLEM WITH DEPENDENT JOBS, Computers & industrial engineering, 25(1-4), 1993, pp. 235-238
Citations number
6
Categorie Soggetti
Computer Application, Chemistry & Engineering",Engineering,"Computer Applications & Cybernetics
Journal title
Computers & industrial engineering → ACNP
ISSN journal
03608352
Volume
25
Issue
1-4
Year of publication
1993
Pages
235 - 238
Database
ISI
SICI code
0360-8352(1993)25:1-4<235:TOSPWD>2.0.ZU;2-Q
Abstract
The problem of minimizing the makespan on one machine with possible de pendencies between jobs is considered. We enlarge the notion of preced ence constraint by considering a minimal duration between the start ti mes of each pair of dependent jobs. We propose an exact algorithm wher e this duration is taken into account. This algorithm is based on Carl ier's algorithm [Carlier 82] for the One-Machine Sequencing (OMS) prob lem with independent jobs.