An algorithm for single machine sequencing with release dates to minimize maximum cost

DOI10.1016/0166-218X(89)90036-XzbMath0673.90055MaRDI QIDQ1121165

Stanisław Zdrzałka, Jozef Grabowski

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundsingle machinelower boundsheuristicrelease datesprecedence constraintsgeneral cost functionsComputational experimentsblock of jobsDominance relationsminimizing maximum cost

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

A sequencing problem with family setup times ⋮ A procedure for the one-machine sequencing problem with dependent jobs ⋮ On optimal lateness and tardiness scheduling in real-time systems

Cites Work

• A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
• A block approach for single-machine scheduling with release dates and due dates
• On lower bounds on the minimum maximum lateness on one machine subject to release date
• The one-machine sequencing problem
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Minimizing maximum lateness on one machine: computational experience and some applications
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sequencing with due-dates and early start times to minimize maximum tardiness
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for single machine sequencing with release dates to minimize maximum cost