The Browne-Yechiali single-machine sequence is optimal for flow-shops

DOI10.1016/j.cor.2010.01.006zbMath1188.90104OpenAlexW2009580080MaRDI QIDQ976013

Assaf Sarig, Gur Mosheiov, Jeffrey B. Sidney

Publication date: 11 June 2010

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

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

zbMATH Keywords

schedulingmakespanflow-shoplinear deterioration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Permutation flowshop scheduling with simple linear deterioration ⋮ Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ 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 ⋮ Multiobjective fuzzy mixed assembly line sequencing optimization model ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS

Cites Work

• Unnamed Item
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines
• Total completion time in a two-machine flowshop with deteriorating tasks
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• Scheduling Deteriorating Jobs on a Single Processor
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Two‐machine flowshop scheduling with conditional deteriorating second operations

This page was built for publication: The Browne-Yechiali single-machine sequence is optimal for flow-shops