Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

DOI10.1016/0305-0548(96)00016-0zbMath0870.90073OpenAlexW1999466794MaRDI QIDQ2564755

Jack A. A. van der Veen, Shu-Zhong Zhang

Publication date: 15 January 1997

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

Full work available at URL: http://repub.eur.nl/pub/59984

zbMATH Keywords

parallel machinesmakespanidentical processing times

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

Many Visits TSP Revisited ⋮ Feasibility recovery for the unit-capacity constrained permutation problem ⋮ The unit-capacity constrained permutation problem ⋮ Single machine scheduling with two job classes : minimizing maximum lateness ⋮ On the high multiplicity traveling salesman problem ⋮ Domino sequencing: scheduling with state-based sequence-dependent setup times ⋮ Many-visits TSP revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sequencing problem in the weaving industry
• Integer Programming with a Fixed Number of Variables
• The Traveling Salesman Problem with Many Visits to Few Cities
• Scheduling tasks with sequence-dependent processing times
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem