A unified formulation of the machine scheduling problem

DOI10.1016/0377-2217(78)90120-0zbMath0376.90054OpenAlexW1977694650MaRDI QIDQ1245650

K. Appert

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0377-2217(78)90120-0

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items

Heuristics and their design: A survey

Cites Work

• Unnamed Item
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
• The Schedule-Sequencing Problem
• A Branch-Bound Solution to the General Scheduling Problem
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• A Generalized Machine-Scheduling Algorithm
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
• A Direct Search Method to Locate Negative Cycles in a Graph
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey