Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration

DOI10.1142/S0217595915500505zbMath1335.90045OpenAlexW2232856748MaRDI QIDQ2788531

Na Yin, Li-ying Kang

Publication date: 19 February 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595915500505

zbMATH Keywords

schedulingmakespanflow shopheuristicproportional deterioration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects ⋮ The Interaction Between Critical Chain Sequencing, Buffer Sizing, and Reactive Actions in a CC/BM Framework ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times ⋮ Single Machine Two-Agent Scheduling with Deteriorating Jobs

Cites Work

• Minimizing makespan in three-machine flow shops with deteriorating jobs
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
• Single-machine scheduling with deteriorating functions for job processing times
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• Single-machine due-window assignment problem with learning effect and deteriorating jobs
• Single machine group scheduling with time dependent processing times and ready times
• Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Time-dependent scheduling
• Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
• A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• Multi-machine scheduling with deteriorating jobs and scheduled maintenance
• SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS
• A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION
• SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION
• 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
• SCHEDULING WITH POSITION-BASED DETERIORATING JOBS AND MULTIPLE DETERIORATING RATE-MODIFYING ACTIVITIES
• Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
• Scheduling

This page was built for publication: Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration