Minimizing makespan in a two-machine flow shop with effects of deterioration and learning

DOI10.1007/s11590-011-0334-yzbMath1259.90039OpenAlexW2116082811MaRDI QIDQ694178

Dan Wang, Ji-Bo Wang, Ping Ji, Cheng, T. C. Edwin

Publication date: 11 December 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0334-y

zbMATH Keywords

branch-and-bound algorithmdeteriorating jobsmakespanflow shoplearning effect

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (21)

Scheduling deteriorating jobs with a learning effect on unrelated parallel machines ⋮ Scheduling with a position-weighted learning effect and job release dates ⋮ A note on ``Single-machine scheduling problems with both deteriorating jobs and learning effects ⋮ Tri-criteria single machine scheduling model with release times and learning factor ⋮ Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times ⋮ Scheduling jobs with truncated exponential learning functions ⋮ An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects ⋮ Single-machine group scheduling with general deterioration and learning effects ⋮ Optimal due-date assignment problem with learning effect and resource-dependent processing times ⋮ Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time ⋮ Single-machine scheduling with accelerating deterioration effects ⋮ Single machine scheduling with exponential learning functions ⋮ Some results of the worst-case analysis for flow shop scheduling with a learning effect ⋮ Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights ⋮ Single-machine ready times scheduling with group technology and proportional linear deterioration ⋮ Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times ⋮ The single-machine total tardiness problem with unequal release times and a linear deterioration ⋮ Single-machine scheduling problems with precedence constraints and simple linear deterioration ⋮ A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect ⋮ A NOTE ON "SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING" ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
• Single-machine scheduling with nonlinear deterioration
• A note on single-machine scheduling with nonlinear deterioration
• A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• Time-dependent scheduling
• Single-machine scheduling problems with a learning effect
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Single-machine scheduling with learning considerations
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Heuristic for a new multiobjective scheduling problem
• Parallel-machine scheduling under potential disruption
• A state-of-the-art review on scheduling with learning effects
• Scheduling with time dependent processing times: Review and extensions
• Encyclopedia of Optimization

This page was built for publication: Minimizing makespan in a two-machine flow shop with effects of deterioration and learning