Total completion time in a two-machine flowshop with deteriorating tasks

DOI10.1007/s10852-007-9057-6zbMath1140.90399OpenAlexW2076342971MaRDI QIDQ928678

Ammar Oulamara, Gerd Finke

Publication date: 11 June 2008

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-007-9057-6

zbMATH Keywords

FlowshopTotal completion timeState-dependent processing time

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

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

Cites Work

• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A variant of the permutation flow shop model with variable processing times
• Parallel machine scheduling with time dependent processing times
• Single machine scheduling with nonlinear cost functions
• Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
• General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration
• General flow-shop scheduling with resource constraints
• The two-machine permutation flow shop with state-dependent processing times
• Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
• Λ-Shaped Policies to Schedule Deteriorating Jobs
• Multi-Machine Scheduling With Linear Deterioration