Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine

DOI10.1016/J.EJOR.2009.03.018zbMath1175.90184OpenAlexW2156976424MaRDI QIDQ1037662

Gur Mosheiov, Assaf Sarig

Publication date: 16 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.018

zbMATH Keywords

schedulingweighted number of tardy jobsflow-shopcritical machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (5)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines ⋮ A heuristic method for two-stage hybrid flow shop with dedicated machines ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type

Cites Work

• The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
• Two-stage flowshop scheduling with a common second-stage machine
• Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
• Flow shop and open shop scheduling with a critical machine and two operations per job
• Scheduling shops to minimize the weighted number of late jobs
• Optimal two- and three-stage production schedules with setup times included
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times

This page was built for publication: Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine