Flow-shops with a dominant machine

DOI10.1016/0377-2217(92)90175-9zbMath0773.90038OpenAlexW1996327625MaRDI QIDQ1203800

Marc Krabbenborg, Anne van den Nouweland, Jos A. M. Potters

Publication date: 18 February 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90175-9

zbMATH Keywords

polynomial-time algorithmregular criteriamaximal latenesspermutation schedulesdominant machineflow-shop problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (22)

Sequencing games with controllable processing times ⋮ Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ Proportionate flow shop games ⋮ Flowshop scheduling with dominant machines ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ 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 ⋮ Batch sequencing and cooperation ⋮ Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect ⋮ Scheduling with a position-weighted learning effect ⋮ Flowshop scheduling problems with a position-dependent exponential learning effect ⋮ Open shop scheduling games ⋮ No-wait or no-idle permutation flowshop scheduling with dominating machines ⋮ Makespan minimization in machine dominated flowshop ⋮ Incomplete information and multiple machine queueing problems ⋮ On the balancedness of multiple machine sequencing games ⋮ Non-bottleneck machines in three-machine flow shops ⋮ Job scheduling, cooperation, and control ⋮ Nonpreemptive flowshop scheduling with machine dominance ⋮ On the convexity of precedence sequencing games ⋮ Balancedness of sequencing games with multiple parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequencing games
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Errata
• Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
• Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem

This page was built for publication: Flow-shops with a dominant machine