Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

DOI10.1016/j.cor.2011.09.011zbMath1251.90172OpenAlexW2058051104MaRDI QIDQ1762149

Daniel Oron, Gur Mosheiov

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1016/j.cor.2011.09.011

zbMATH Keywords

schedulingmakespanproportionate flowshopposition-dependent processing timesminimum number of tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review, Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms, Several flow shop scheduling problems with truncated position-based learning effect, Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs, Research on permutation flow shop scheduling problems with general position-dependent learning effects, Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times

Cites Work

• Unnamed Item
• Assignment problems: a golden anniversary survey
• Single-machine scheduling with learning considerations
• On solving a variation of the assignment problem
• Scheduling with general job-dependent learning curves.
• Scheduling shops to minimize the weighted number of late jobs
• Proportionate flowshops with general position-dependent processing times
• A competitive (dual) simplex method for the assignment problem
• Scheduling jobs with position-dependent processing times
• Note on scheduling with general learning curves to minimize the number of tardy jobs
• Single machine scheduling with learning effect considerations