Review of the ordered and proportionate flow shop scheduling research
From MaRDI portal
Publication:3120585
DOI10.1002/NAV.21518zbMath1407.90171OpenAlexW2077168140MaRDI QIDQ3120585
Milton L. Smith, Christos P. Koulamas, Shrikant S. Panwalkar
Publication date: 5 March 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21518
Related Items (24)
Due-window assignment scheduling in the proportionate flow shop setting ⋮ The two-machine no-wait general and proportionate open shop makespan problem ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Proportionate flowshop scheduling with position-dependent weights ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Proportionate Flow Shop Scheduling with Rejection ⋮ A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop ⋮ A note: minimizing maximum earliness on a proportionate flowshop ⋮ Online scheduling of ordered flow shops ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ Approximation algorithms for the three-machine proportionate mixed shop scheduling ⋮ Scheduling a proportionate flow shop of batching machines ⋮ Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights ⋮ Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates ⋮ Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines ⋮ Regular scheduling measures on proportionate flowshop with job rejection ⋮ Improved algorithms for proportionate flow shop scheduling with due-window assignment ⋮ Online algorithms to schedule a proportionate flexible flow shop of batching machines ⋮ Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs
This page was built for publication: Review of the ordered and proportionate flow shop scheduling research
