Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
From MaRDI portal
Publication:323343
DOI10.1016/J.EJOR.2016.03.037zbMath1346.90374OpenAlexW2315720050MaRDI QIDQ323343
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.037
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (11)
Due-window assignment scheduling in the proportionate flow shop setting ⋮ Proportionate flowshop scheduling with position-dependent weights ⋮ Due-window assignment scheduling problems with position-dependent weights on a single machine ⋮ A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights ⋮ Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine ⋮ Optimization for due-window assignment scheduling with position-dependent weights ⋮ Single machine slack due window assignment and deteriorating jobs ⋮ Minmax due-date assignment on a two-machine flowshop ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ Regular scheduling measures on proportionate flowshop with job rejection ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
Cites Work
- Unnamed Item
- Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Single machine common flow allowance scheduling with controllable processing times
- A survey on scheduling problems with due windows
- Review of the ordered and proportionate flow shop scheduling research
- Common due window size and location determination in a single machine scheduling problem
- Single Machine Scheduling with Flow Allowances
- Scheduling
This page was built for publication: Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
