Reoptimization of the minimum total flow-time scheduling problem

DOI10.1007/978-3-642-34862-4_4MaRDI QIDQ4916032zbMATH OpenOpenAlexFDO

Authors Guy Baram, Tami Tamir

Publication date 19 April 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34862-4_4

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Analysis and experimental study of heuristics for job scheduling reoptimization problems
• Reoptimization in machine scheduling
• Robust algorithms for total completion time
• Automata, Languages and Programming
• Rescheduling for multiple new orders

Cited in

(10)

• Scheduling problems with rejection to minimize the maximum flow time
• A theory and algorithms for combinatorial reoptimization
• Scheduling for weighted flow time and energy with rejection penalty
• Reoptimization in machine scheduling
• scientific article; zbMATH DE number 6719013 (Why is no real title available?)
• scientific article; zbMATH DE number 5999563 (Why is no real title available?)
• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• scientific article; zbMATH DE number 3850790 (Why is no real title available?)
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Analysis and experimental study of heuristics for job scheduling reoptimization problems

This page was built for publication: Reoptimization of the minimum total flow-time scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916032)