A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
From MaRDI portal
Publication:733523
DOI10.1016/j.cor.2009.03.019zbMath1171.90404OpenAlexW2072723821MaRDI QIDQ733523
Publication date: 16 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.03.019
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (30)
Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS ⋮ Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning ⋮ Single-machine scheduling with logarithm deterioration ⋮ Single-machine scheduling with deteriorating functions for job processing times ⋮ Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine ⋮ Two-machine flow shop total tardiness scheduling problem with deteriorating jobs ⋮ The study of group scheduling problems with general dual-position-based job processing times ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ Single-machine scheduling with time-and-resource-dependent processing times ⋮ Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect ⋮ Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption ⋮ Considerations of single-machine scheduling with deteriorating jobs ⋮ Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time ⋮ A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem ⋮ Some single-machine and flowshop scheduling problems with a non-linear deterioration function ⋮ A single-machine scheduling with a truncated linear deterioration and ready times ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ Scheduling time-dependent jobs under mixed deterioration ⋮ Minimizing makespan in a two-machine flow shop with effects of deterioration and learning ⋮ Single-machine total completion time scheduling with a time-dependent deterioration ⋮ Single-machine makespan minimization scheduling with nonlinear shortening processing times ⋮ Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
Cites Work
- Unnamed Item
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Complexity analysis of job-shop scheduling with deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- The Complexity of Flowshop and Jobshop Scheduling
- 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: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
