Flowshop scheduling with dominant machines
This paper considers two special cases of the permutation flowshop scheduling problem: the flowshop with an increasing series of dominating machines \((M_1\prec M_2\prec\cdots\prec M_m)\) and the flowshop with a decreasing series of dominating machines \((M_1\succ M_2\succ\cdots\succ M_m)\). Machine \(a\) dominates machines \(b\) \((M_a\succ M_b)\) if \(\min\{t(i, a)\mid i\in \mathbb{N}\}\geq \max\{t(i, b)\mid i\in \mathbb{N}\}\), where \(t(i, a)\), the processing time of job \(i\) on machine \(a\) and \(N= \{1,2,\dots, n\}\), set of all \(n\) jobs. The authors discuss these two special cases with the following objective functions: the maximum flowtime (makespan) \(C_{\max}\), the mean flowtime (equivalent to the sum of completion times of all jobs at the last machine \(\sum C_i\)), the sum of completion times of the last job of all machines \(\sum C_{[n]j}\), the total number of tardy jobs \(\sum U_i\), the maximum lateness \(L_{\max}\) or tardiness \(T_{\max}\). Based on the analysis of the special cases, simple polynomial-time algorithms are given.
- Flow-shops with a dominant machine
- Makespan minimization in machine dominated flowshop
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- scientific article; zbMATH DE number 2186529
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Flow-shops with a dominant machine
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- Focused Scheduling in Proportionate Flowshops
- scientific article; zbMATH DE number 3425355 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Optimal schedules for special structure flowshops
- Optimal two- and three-stage production schedules with set-up time included
- Ordered Flow Shop Problems with no In-Process Waiting: Further Results
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- Flow-shops with a dominant machine
- RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions.
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Non-bottleneck machines in three-machine flow shops
- Nonpreemptive flowshop scheduling with machine dominance
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- Some scheduling problems with time-dependent learning effect and deteriorating jobs
- Minimizing tardy jobs in a flowshop with common due date
- A two-machine no-wait flow shop problem with two competing agents
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- 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
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- scientific article; zbMATH DE number 2186529 (Why is no real title available?)
- scientific article; zbMATH DE number 3883926 (Why is no real title available?)
- Solution algorithms for synchronous flow shop problems with two dominating machines
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Sensitivity analysis for some scheduling problems
- Flow shop scheduling problems with time-dependent processing times on dominated machines
- Scheduling deteriorating jobs with rejection on dominant machines
- Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
- Open-shop scheduling problems with dominated machines
- Minimizing Mean Completion Time for Special Flowshop Problems
- Flowshop scheduling problems with a position-dependent exponential learning effect
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- A note on scheduling problems with learning effect and deteriorating jobs
- Optimal four-machine flow shop scheduling with dominance condition
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
- A systematic review of permutation flow shop scheduling with due-date-related objectives
- Makespan minimization in machine dominated flowshop
- Complexity results for flow shop problems with synchronous movement
- Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
This page was built for publication: Flowshop scheduling with dominant machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342341)
