Effective heuristics for the single machine sequencing problem with ready times

DOI10.1080/00207549108948029zbMath0728.90042OpenAlexW2025816555MaRDI QIDQ3352822

Jiyin Liu, Bart L. MacCarthy

Publication date: 1991

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549108948029

zbMATH Keywords

heuristicsbranch and boundmean completion timesingle machine sequencingdifferent ready times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

A mixed integer programming approach for the single machine problem with unequal release dates ⋮ Note on a single-machine scheduling problem with sum of processing times based learning and ready times ⋮ Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates

Cites Work

• Unnamed Item
• A block approach for single-machine scheduling with release dates and due dates
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• On Scheduling with Ready Times to Minimize Mean Flow Time
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times

This page was built for publication: Effective heuristics for the single machine sequencing problem with ready times