A unified formulation of the machine scheduling problem
type: Item
instance of: scholarly article
title: A unified formulation of the machine scheduling problem
zbMATH Open document ID: 0376.90054
DOI: 10.1016/0377-2217(78)90120-0
author: K. Appert
published in: European Journal of Operational Research
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3586802
MaRDI profile type: Publication
full work available at URL: 0377-2217(78)90120-0
OpenAlex ID: W1977694650
cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
cites work: The Schedule-Sequencing Problem
cites work: A Generalized Machine-Scheduling Algorithm
cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables
cites work: A Direct Search Method to Locate Negative Cycles in a Graph
cites work: Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
cites work: A Branch-Bound Solution to the General Scheduling Problem
cites work: Q4404428
cites work: Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
description: scientific article; zbMATH DE number 3586802