Scheduling Models: Shibboleth and Operating Characteristics
From MaRDI portal
Publication:4747900
DOI10.1080/02522667.1983.10698750zbMath0508.90049OpenAlexW1986329090MaRDI QIDQ4747900
Publication date: 1983
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1983.10698750
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- Preemptive Scheduling with Due Dates
- Scheduling Jobs on Two Facilities to Minimize Makespan
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem
This page was built for publication: Scheduling Models: Shibboleth and Operating Characteristics