Permutation flow shop problem with shortening job processing times
DOI10.1142/S0217595916500329zbMATH Open1348.90324OpenAlexW2499725767MaRDI QIDQ2821099FDOQ2821099
Authors: Zhenyou Wang, Caimin Wei, 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
Recommendations
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- The two-machine permutation flow shop with state-dependent processing times
- A three-machine permutation flow-shop problem with minimum makespan on the second machine
- A permutation flow-shop scheduling problem with convex models of operation processing times
- Makespan minimization on three-machine flow shop with deteriorating jobs
branch-and-bound algorithmschedulingheuristic algorithmmakespanpermutation flow shopshortening job processing times
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- Time-dependent scheduling
- Complexity of scheduling tasks with time-dependent execution times
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Minimizing makespan in permutation flow shop scheduling with proportional deterioration
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Makespan minimization on three-machine flow shop with deteriorating jobs
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- Scheduling jobs under decreasing linear deterioration
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- A note on the complexity of flow-shop scheduling with deteriorating jobs
- The Browne-Yechiali single-machine sequence is optimal for flow-shops
- Scheduling with deteriorating jobs and non-simultaneous machine available times
- Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects
- Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
- Some scheduling problems on a single machine with general job effects of position-dependent learning and start-time-dependent deterioration
Cited In (3)
This page was built for publication: Permutation flow shop problem with shortening job processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821099)
