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

DOI10.1007/S11590-011-0334-YzbMATH Open1259.90039OpenAlexW2116082811MaRDI QIDQ694178FDOQ694178

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

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

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)

Cites Work

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

Cited In (26)

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

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)