Two-machine flowshop minimum-length scheduling problem with random and bounded processing times

DOI10.1111/1475-3995.00393zbMath1027.90026OpenAlexW2008958187MaRDI QIDQ4806914

Yuri N. Sotskov, Ali Allahverdi

Publication date: 23 June 2003

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00393

zbMATH Keywords

schedulingmakespanflowshopdominance relations

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

Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ Schedule execution for two-machine flow-shop with interval processing times ⋮ Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ Minimizing total weighted flow time of a set of jobs with interval processing times ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times ⋮ TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES ⋮ The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times ⋮ A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation ⋮ Johnson's problem with stochastic processing times and optimal service level ⋮ Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm

Cites Work

• Unnamed Item
• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• Two-machine ordered flowshop scheduling under random breakdowns
• Scheduling in stochastic flowshops with independent setup, processing and removal times
• Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
• Stochastically minimizing the makespan in two-machine flow shops without blocking
• Two machine mixed shop scheduling problem with controllable machine speeds
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness