A procedure for the one-machine sequencing problem with dependent jobs

DOI10.1016/0377-2217(93)E0322-OzbMath0920.90071OpenAlexW2093972119MaRDI QIDQ1130073

Stéphane Dauzère-Pérès

Publication date: 15 September 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0322-o

zbMATH Keywords

makespanprecedence constraintdependencies between jobsminimal duration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ Unnamed Item ⋮ Deterministic job-shop scheduling: Past, present and future

Cites Work

• Unnamed Item
• Unnamed Item
• A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
• An algorithm for single machine sequencing with release dates to minimize maximum cost
• The one-machine sequencing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Minimizing maximum lateness on one machine: computational experience and some applications
• Some simple scheduling algorithms
• A modified shifting bottleneck procedure for job-shop scheduling

This page was built for publication: A procedure for the one-machine sequencing problem with dependent jobs