Improved algorithms for proportionate flow shop scheduling with due-window assignment
From MaRDI portal
Publication:2069253
DOI10.1007/s10479-021-04414-4zbMath1480.90141OpenAlexW3215637927MaRDI QIDQ2069253
Publication date: 20 January 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-021-04414-4
schedulingalgorithm complexitydue-window assignmentproportionate flow shopposition-dependent weights
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Due-window assignment scheduling in the proportionate flow shop setting
- Proportionate flow shop games
- A comprehensive review of flowshop group scheduling literature
- Bicriterion optimization for flow shop with a learning effect subject to release dates
- Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
- Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
- The proportionate flow shop total tardiness problem
- Review of the ordered and proportionate flow shop scheduling research
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On equivalence between the proportionate flow shop and single‐machine scheduling problems
- Proportionate flowshop scheduling with position-dependent weights
- Due-window assignment scheduling problems with position-dependent weights on a single machine
- Research on m‐machine flow shop scheduling with truncated learning effects
- Common due-window assignment for single-machine scheduling with generalized earliness/tardiness penalties and a rate-modifying activity
