Flowshop scheduling with dominant machines

DOI10.1016/0305-0548(94)E0007-TzbMath0826.90064OpenAlexW2039783295MaRDI QIDQ1342341

Johnny C. Ho, Jatinder N. D. Gupta

Publication date: 23 November 1995

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

Full work available at URL: https://doi.org/10.1016/0305-0548(94)e0007-t

zbMATH Keywords

makespantardinesspolynomial-time algorithmsmaximum latenesspermutation flowshop schedulingsum of completion timesmachine dominancemean flowtimemaximum flowtimetotal number of tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (33)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines ⋮ Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ Minimizing total completion time in a two-machine flow shop with deteriorating jobs ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ Solution algorithms for synchronous flow shop problems with two dominating machines ⋮ 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 branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ A note on flow shop scheduling problems with a learning effect on no-idle dominant machines ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ 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. ⋮ Minimizing Mean Completion Time for Special Flowshop Problems ⋮ Sensitivity analysis for some scheduling problems ⋮ Flowshop scheduling problems with a position-dependent exponential learning effect ⋮ Minimizing tardy jobs in a flowshop with common due date ⋮ No-wait or no-idle permutation flowshop scheduling with dominating machines ⋮ A note on scheduling problems with learning effect and deteriorating jobs ⋮ Makespan minimization in machine dominated flowshop ⋮ Two-machine flowshop scheduling with job class setups to minimize total flowtime ⋮ Complexity results for flow shop problems with synchronous movement ⋮ Some scheduling problems with time-dependent learning effect and deteriorating jobs ⋮ Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs ⋮ An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Scheduling deteriorating jobs with rejection on dominant machines ⋮ Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times ⋮ A two-machine no-wait flow shop problem with two competing agents ⋮ Non-bottleneck machines in three-machine flow shops ⋮ SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING ⋮ Nonpreemptive flowshop scheduling with machine dominance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flow-shops with a dominant machine
• Optimal two- and three-stage production schedules with setup times included
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• Focused Scheduling in Proportionate Flowshops
• Ordered Flow Shop Problems with no In-Process Waiting: Further Results
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Optimal schedules for special structure flowshops
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Flowshop scheduling with dominant machines