Flow shop scheduling problems with decreasing linear deterioration under dominant machines

DOI10.1016/J.COR.2005.08.008MaRDI QIDQ868141zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• Flowshop scheduling with dominant machines
• Flow shop scheduling problems with time-dependent processing times on dominated machines
• Some single-machine and flowshop scheduling problems with a non-linear deterioration function
• Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
• Flow shop scheduling problems under machine-dependent precedence constraints
• A note on the complexity of flow-shop scheduling with deteriorating jobs

Cites work

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

Cited in

(26)

• Scheduling of computational processes in real-time distributed systems with uncertain task execution times
• A survey of scheduling problems with no-wait in process
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• Minimizing makespan in permutation flow shop scheduling with proportional deterioration
• Makespan minimization in machine dominated flowshop
• The Browne-Yechiali single-machine sequence is optimal for flow-shops
• Flow-shops with a dominant machine
• Makespan minimization on three-machine flow shop with deteriorating jobs
• scientific article; zbMATH DE number 2186529 (Why is no real title available?)
• Single machine group scheduling under decreasing linear deterioration
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
• Single machine group scheduling with time dependent processing times and ready times
• General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration
• A note on single-machine scheduling with decreasing time-dependent job processing times
• Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
• Optimal four-machine flow shop scheduling with dominance condition
• Flow shops with machine maintenance: ordered and proportionate cases
• A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• Flow shop scheduling problems with time-dependent processing times on dominated machines
• Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
• 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
• Scheduling jobs under decreasing linear deterioration

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

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