A unified formulation of the machine scheduling problem

DOI10.1016/0377-2217(78)90120-0MaRDI QIDQ1245650zbMATH OpenOpenAlexFDO

Authors 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) Deterministic scheduling theory in operations research (90B35) Applications of mathematical programming (90C90)

Cites work

• A Branch-Bound Solution to the General Scheduling Problem
• A Direct Search Method to Locate Negative Cycles in a Graph
• A Generalized Machine-Scheduling Algorithm
• Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
• scientific article; zbMATH DE number 3438384 (Why is no real title available?)
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
• The schedule-sequencing problem

Cited in

(1)

• Heuristics and their design: A survey

This page was built for publication: A unified formulation of the machine scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245650)