Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates

DOI10.1016/j.cor.2008.07.008zbMath1179.90142MaRDI QIDQ1001006

J. Martínez

Publication date: 12 February 2009

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

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

zbMATH Keywords

scheduling; deteriorating jobs; flow shop; total completion time

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• A concise survey of scheduling with time-dependent processing times
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem