Single machine scheduling subject to precedence delays

DOI10.1016/0166-218X(96)00110-2zbMath0865.68007OpenAlexW2010882308MaRDI QIDQ2563923

Zhen Liu, Lucian Finta

Publication date: 23 June 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

makespansingle-machine scheduling problemprecedence delay

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Minimum equivalent precedence relation systems ⋮ Bin Packing Problem with Time Lags ⋮ A memetic algorithm for the job-shop with time-lags ⋮ An integer programming approach to optimal basic block instruction scheduling for single-issue processors ⋮ Scheduling with bully selfish jobs ⋮ Two simulated annealing-based heuristics for the job shop scheduling problem

Cites Work

• Unnamed Item
• Multiprocessor scheduling with communication delays
• The one-machine sequencing problem
• NP-complete scheduling problems
• Integration of lotsizing and scheduling decisions in a job-shop
• Optimal scheduling for two-processor systems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms
• A modified shifting bottleneck procedure for job-shop scheduling

This page was built for publication: Single machine scheduling subject to precedence delays