MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
From MaRDI portal
Publication:2873830
DOI10.1142/S021759591350022XzbMath1401.90086OpenAlexW2140584489MaRDI QIDQ2873830
Publication date: 27 January 2014
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021759591350022x
Related Items (6)
Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects ⋮ Single machine group scheduling with decreasing time-dependent processing times subject to release dates ⋮ Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights ⋮ Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times ⋮ A NOTE ON "SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING"
Cites Work
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
- Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Parallel-machine scheduling of simple linear 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
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- 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
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION
- SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling Deteriorating Jobs on a Single Processor
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Flow shop scheduling problems with deteriorating jobs under dominating machines
This page was built for publication: MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
