Scheduling experiments on a nulear reactor using mixed integer programming

DOI10.1016/S0305-0548(00)00023-XzbMath1017.90046OpenAlexW2090718165WikidataQ127230222 ScholiaQ127230222MaRDI QIDQ5945333

Wilbert E. Wilhelm, Lawrence David Drees

Publication date: 3 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00023-x

zbMATH Keywords

parallel machinesmixed integer programmingheuristicflowshopresource constrained scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• A state-of-the-art review of parallel-machine scheduling research
• A heuristic for multiple choice programming
• Branch-and-bound and parallel computation: A historical note
• Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics
• Optimal two- and three-stage production schedules with setup times included
• An analysis of six greedy selection rules on a class of zero-one integer programming models
• A heuristic with tie breaking for certain 0–1 integer programming models
• Pivot and Complement–A Heuristic for 0-1 Programming
• An Evaluation of Flow Shop Sequencing Heuristics
• Scheduling Multiple Variable-Speed Machines
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: Scheduling experiments on a nulear reactor using mixed integer programming