A unified formulation of the machine scheduling problem

DOI10.1016/0377-2217(78)90120-0zbMATH Open0376.90054OpenAlexW1977694650MaRDI QIDQ1245650FDOQ1245650

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

Cites Work

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

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)