Minimizing makespan in three-machine flow shops with deteriorating jobs
From MaRDI portal
Publication:340257
DOI10.1016/j.cor.2012.08.006zbMath1349.90410OpenAlexW2083198448MaRDI QIDQ340257
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (33)
Due-window assignment scheduling in the proportionate flow shop setting ⋮ Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines ⋮ Three-machine flow shop scheduling with overlapping waiting time constraints ⋮ 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 ⋮ A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ A note on minimizing makespan in three machine flow shop with deteriorating jobs ⋮ Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects ⋮ Two parallel-machine scheduling problems with function constraint ⋮ Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects ⋮ Optimization of scheduling problems with deterioration effects and an optional maintenance activity ⋮ A maintenance activity scheduling with time-and-position dependent deteriorating effects ⋮ Single machine group scheduling with decreasing time-dependent processing times subject to release dates ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ Single-machine ready times scheduling with group technology and proportional linear deterioration ⋮ Flow shop scheduling problem with position-dependent processing times ⋮ Triage Scheduling Optimization for Mass Casualty and Disaster Response ⋮ Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ Scheduling jobs with position and sum-of-processing-time based processing times ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs ⋮ The single-machine total tardiness problem with unequal release times and a linear deterioration ⋮ Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times ⋮ Improved algorithms for proportionate flow shop scheduling with due-window assignment ⋮ Single Machine Two-Agent Scheduling with Deteriorating Jobs ⋮ Single-machine scheduling problems with precedence constraints and simple linear deterioration ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS ⋮ A NOTE ON "SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING" ⋮ Scheduling problems with effects of deterioration and truncated job-dependent learning
This page was built for publication: Minimizing makespan in three-machine flow shops with deteriorating jobs
