A backward approach in list scheduling algorithms for multi-machine tardiness problems

DOI10.1016/0305-0548(94)E0019-4zbMath0827.90073OpenAlexW2010063115MaRDI QIDQ1891242

Yeong-Dae Kim

Publication date: 13 December 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)e0019-4

zbMATH Keywords

list schedulingbackward approachprecedence relationships among operations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ Scheduling on parallel identical machines to minimize total tardiness ⋮ A fast finite loading algorithm for job oriented scheduling ⋮ Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times ⋮ Scheduling algorithms for a semiconductor probing facility ⋮ New heuristics for total tardiness minimization in a flexible flowshop ⋮ Solving the resource-constrained project scheduling problem by a variable neighbourhood search. ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ Parallel machine scheduling considering a job-splitting property ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Bottleneck-focused scheduling for a hybrid flowshop ⋮ A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints

Cites Work

• Unnamed Item
• Hu's precedence tree scheduling algorithm: A simple proof
• A general search sequencing rule for job shop sequencing
• Linear-Time Algorithms for Scheduling on Parallel Processors
• Job Shop Scheduling by Simulated Annealing
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Survey of Scheduling Rules
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• Scheduling Opposing Forests

This page was built for publication: A backward approach in list scheduling algorithms for multi-machine tardiness problems