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

DOI10.1007/S11590-011-0334-YMaRDI QIDQ694178zbMATH OpenOpenAlexFDO

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

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 algorithmmakespanflow shopdeteriorating jobslearning effect

Mathematics Subject Classification ID

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

Recommendations

• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Flow shop scheduling with effects of learning and deterioration
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
• Scheduling with deteriorating jobs and learning effects
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration

Cites work

• scientific article; zbMATH DE number 846225 (Why is no real title available?)
• 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
• A concise survey of scheduling with time-dependent processing times
• A note on single-machine scheduling with nonlinear deterioration
• A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
• A state-of-the-art review on scheduling with learning effects
• Complexity analysis of job-shop scheduling with deteriorating jobs
• Encyclopedia of Optimization
• Handbook of applied optimization
• Heuristic for a new multiobjective scheduling problem
• Parallel-machine scheduling under potential disruption
• Scheduling with time dependent processing times: Review and extensions
• Single-machine scheduling problems with a learning effect
• Single-machine scheduling with learning considerations
• Single-machine scheduling with nonlinear deterioration
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Time-dependent scheduling

Cited in

(29)

• Flow shop scheduling problem with position-dependent processing times
• Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
• Flow shop scheduling with effects of learning and deterioration
• A note on ``Single-machine scheduling problems with both deteriorating jobs and learning effects
• Two-machine flow shop scheduling with a common due date to maximize total early work
• Single machine scheduling with exponential learning functions
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
• Single-machine scheduling with accelerating deterioration effects
• Single-machine scheduling problems with precedence constraints and simple linear deterioration
• Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
• Scheduling jobs with truncated exponential learning functions
• Single-machine group scheduling with general deterioration and learning effects
• Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
• A makespan study of the two-machine flowshop scheduling problem with a learning effect
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Flow shop resource allocation scheduling with due date assignment, learning effect and position-dependent weights
• Tri-criteria single machine scheduling model with release times and learning factor
• 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
• Minimizing makespan on two parallel machines with learning effects
• Single-machine ready times scheduling with group technology and proportional linear deterioration
• A note on ``Scheduling problems with the effects of deterioration and learning
• Some results of the worst-case analysis for flow shop scheduling with a learning effect
• Group scheduling problems with time-dependent and position-dependent DeJong's learning effect
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• The single-machine total tardiness problem with unequal release times and a linear deterioration
• A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect
• Scheduling with a position-weighted learning effect and job release dates

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694178)