Flow shop scheduling problems with decreasing linear deterioration under dominant machines

DOI10.1016/j.cor.2005.08.008zbMath1193.90116OpenAlexW2030231974MaRDI QIDQ868141

N. E. Zubov

Publication date: 19 February 2007

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

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

zbMATH Keywords

schedulingflow shoplinear deteriorationdominant machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (15)

A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning ⋮ Single machine quadratic penalty function scheduling with deteriorating jobs and group technology ⋮ Scheduling of computational processes in real-time distributed systems with uncertain task execution times ⋮ Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties ⋮ Single machine group scheduling under decreasing linear deterioration ⋮ A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness ⋮ A survey of scheduling problems with no-wait in process ⋮ Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties ⋮ A note on single-machine scheduling with decreasing time-dependent job processing times ⋮ The Browne-Yechiali single-machine sequence is optimal for flow-shops ⋮ Makespan minimization in machine dominated flowshop ⋮ Single machine group scheduling with time dependent processing times and ready times ⋮ Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS

Cites Work

• Unnamed Item
• The complexity of scheduling starting time dependent tasks with release times
• Scheduling jobs under decreasing linear deterioration
• Flow-shops with a dominant machine
• Scheduling jobs under simple linear deterioration
• Complexity of scheduling tasks with time-dependent execution times
• Flowshop scheduling with dominant machines
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Nonpreemptive flowshop scheduling with machine dominance
• No-wait or no-idle permutation flowshop scheduling with dominating machines
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• The Three-Machine No-Wait Flow Shop is NP-Complete
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Scheduling jobs with position-dependent processing times
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Single machine scheduling with step-deteriorating processing times

This page was built for publication: Flow shop scheduling problems with decreasing linear deterioration under dominant machines