Permutation Flow Shop Problem with Shortening Job Processing Times
DOI10.1142/S0217595916500329zbMath1348.90324OpenAlexW2499725767MaRDI QIDQ2821099
Cai-Min Wei, Zhenyou Wang, Yuan-Yuan Lu
Publication date: 16 September 2016
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595916500329
branch-and-bound algorithmschedulingmakespanheuristic algorithmpermutation flow shopshortening job processing times
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- A note on the complexity of flow-shop scheduling with deteriorating jobs
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Time-dependent scheduling
- The Browne-Yechiali single-machine sequence is optimal for flow-shops
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- Scheduling jobs under decreasing linear deterioration
- Complexity of scheduling tasks with time-dependent execution times
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
- Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times
- Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration
- MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
- Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Some Scheduling Problems on a Single Machine with General Job Effects of Position-Dependent Learning and Start-Time-Dependent Deterioration
- Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects
This page was built for publication: Permutation Flow Shop Problem with Shortening Job Processing Times
