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

DOI10.1007/S10852-007-9057-6MaRDI QIDQ928678zbMATH OpenOpenAlexFDO

Authors Gerd Finke, A. Oulamara

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

Total completion timeFlowshopState-dependent processing time

Mathematics Subject Classification ID

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

Recommendations

• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• Two-machine flow shop total tardiness scheduling problem with deteriorating jobs

Cites work

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

Cited in

(2)

• The Browne-Yechiali single-machine sequence is optimal for flow-shops
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration

This page was built for publication: Total completion time in a two-machine flowshop with deteriorating tasks

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