Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop

DOI10.1007/s43069-021-00096-7zbMath1476.90122MaRDI QIDQ2241320

Abbasali Jafari-Nodoushan, Reza Tavakkoli-Moghaddam, M. M. Lotfi, Hassan Khademi-Zare

Publication date: 8 November 2021

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-021-00096-7

zbMATH Keywords

scheduling; branch and bound; deteriorating jobs; heuristic; flowshop

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C30: Nonlinear programming

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing makespan in three-machine flow shops with deteriorating jobs
• A note on minimizing makespan in three machine flow shop with deteriorating jobs
• Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
• Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• Scheduling linear deteriorating jobs to minimize the number of tardy jobs
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• Improved DE search for competing groups scheduling with deterioration effects
• Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines
• A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• The Browne-Yechiali single-machine sequence is optimal for flow-shops
• Scheduling jobs under simple linear deterioration
• A concise survey of scheduling with time-dependent processing times
• Total tardiness minimization in permutation flowshop with deterioration consideration
• Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
• Identical parallel machine scheduling with time-dependent processing times
• Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
• Minimizing total load on parallel machines with linear deterioration
• Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
• Flow shop scheduling problem with position-dependent processing times
• Scheduling Deteriorating Jobs on a Single Processor
• Parallel machine scheduling problems with proportionally deteriorating jobs
• Scheduling deteriorating jobs to minimize makespan