Minimizing makespan in three-machine flow shops with deteriorating jobs

DOI10.1016/J.COR.2012.08.006zbMATH Open1349.90410OpenAlexW2083198448MaRDI QIDQ340257FDOQ340257

Authors: Ji-Bo Wang, Ming-Zheng Wang 

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.006

Recommendations

• Makespan minimization on three-machine flow shop with deteriorating jobs
• A note on minimizing makespan in three machine flow shop with deteriorating jobs
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Minimizing makespan in a three-stage flexible flowshop with identical machines and two batch processors
• Minimizing makespan in permutation flow shop scheduling with proportional deterioration
• Solving constrained flow-shop scheduling problems with three machines
• A three-machine permutation flow-shop problem with minimum makespan on the second machine
• Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop

zbMATH Keywords

branch-and-bound algorithmschedulingheuristic algorithmmakespanflow shopdeteriorating jobs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cited In (35)

• Due-window assignment scheduling in the proportionate flow shop setting
• Minimizing makespan in permutation flow shop scheduling with proportional deterioration
• Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
• Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines
• Two parallel-machine scheduling problems with function constraint
• Scheduling problems with effects of deterioration and truncated job-dependent learning
• Makespan minimization on three-machine flow shop with deteriorating jobs
• Single machine group scheduling with decreasing time-dependent processing times subject to release dates
• Three-machine flow shop scheduling with overlapping waiting time constraints
• Flow shop scheduling problem with position-dependent processing times
• Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times
• Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity
• Permutation flowshop scheduling with simple linear deterioration
• Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects
• Scheduling jobs with position and sum-of-processing-time based processing times
• Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
• Single machine two-agent scheduling with deteriorating jobs
• A note on ``Scheduling problems with the effects of deterioration and learning
• Scheduling with deteriorating jobs and non-simultaneous machine available times
• Optimization of scheduling problems with deterioration effects and an optional maintenance activity
• 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
• Triage scheduling optimization for mass casualty and disaster response
• Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
• A note on minimizing makespan in three machine flow shop with deteriorating jobs
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Improved algorithms for proportionate flow shop scheduling with due-window assignment
• Single-machine scheduling problems with precedence constraints and simple linear deterioration
• A maintenance activity scheduling with time-and-position dependent deteriorating effects
• Permutation flow shop problem with shortening job processing times
• Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects
• A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times
• Common due window assignment scheduling with proportional linear deterioration effects

This page was built for publication: Minimizing makespan in three-machine flow shops with deteriorating jobs

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