𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Eliminating redundant columns in continuous tour scheduling problems

✍ Scribed by Michael J. Brusco; Larry W. Jacobs

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
104 KB
Volume
111
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a procedure for eliminating redundant columns in generalized set-covering formulations (GSCFs) of continuous tour scheduling problems that are characterized by labor requirements of zero in some planning periods. We describe the procedure and discuss properties of certain scheduling environments that may aect the appropriateness of its use. The procedure was applied to actual labor requirements and problem characteristics associated with 27 United Airlines Airport Stations and reduced the number of columns (tours) by an average of 56%.

📜 SIMILAR VOLUMES

A heuristic approach to allocating the c
A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan
✍ Joanna Józefowska; Marek Mika; Rafał Różycki; Grzegorz Waligóra; Jan Węglarz 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 98 KB

A problem of scheduling jobs on parallel, identical machines under an additional continuous resource to minimize the makespan is considered. Jobs are non-preemtable and independent and all are available at the start of the process. The total amount of the continuous resource available at a time is l