Flow shop scheduling problems with decreasing linear deterioration under dominant machines
From MaRDI portal
Publication:868141
DOI10.1016/J.COR.2005.08.008zbMATH Open1193.90116OpenAlexW2030231974MaRDI QIDQ868141FDOQ868141
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
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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Complexity of scheduling tasks with time-dependent execution times
- The complexity of scheduling starting time dependent tasks with release times
- Scheduling Deteriorating Jobs on a Single Processor
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Scheduling jobs with position-dependent processing times
- Single machine scheduling with step-deteriorating processing times
- Scheduling jobs under simple linear deterioration
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- Flowshop scheduling with dominant machines
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- Scheduling jobs under decreasing linear deterioration
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Title not available (Why is that?)
- Flow-shops with a dominant machine
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Nonpreemptive flowshop scheduling with machine dominance
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Complexity analysis of job-shop scheduling with deteriorating jobs
Cited In (26)
- Scheduling of computational processes in real-time distributed systems with uncertain task execution times
- 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
- The Browne-Yechiali single-machine sequence is optimal for flow-shops
- Makespan minimization in machine dominated flowshop
- Makespan minimization on three-machine flow shop with deteriorating jobs
- Title not available (Why is that?)
- Flow-shops with a dominant machine
- Single machine group scheduling under decreasing linear deterioration
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
- General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration
- Single machine group scheduling with time dependent processing times and ready times
- A note on single-machine scheduling with decreasing time-dependent job processing times
- Optimal four-machine flow shop scheduling with dominance condition
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- Flow shops with machine maintenance: ordered and proportionate cases
- Flow shop scheduling problems with time-dependent processing times on dominated machines
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant 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
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
- Scheduling jobs under decreasing linear deterioration
- A survey of scheduling problems with no-wait in process
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)
