Troels Martin Range
(), Richard Martin Lusby
() and Jesper Larsen
Troels Martin Range: Department of Business and Economics, Postal: COHERE, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark
Richard Martin Lusby: Department of Engineering Management, Postal: Technical University of Denmark, Produktionstorvet, building 426, 2800 Kgs. Lyngby, Denmark
Jesper Larsen: Department of Engineering Management, Postal: Technical University of Denmark, Produktionstorvet, building 426, 2800 Kgs. Lyngby, Denmark
Abstract: In this paper we present a new scheduling problem and describe a shortest path based heuristic as well as a dynamic programming based exact optimization algorithm to solve it. The Selective Multi-Category Parallel-Servicing Problem (SMCPSP) arises when a set of jobs has to be scheduled on a server (machine) with limited capacity. Each job requests service in a prespecified time window and belongs to a certain category. Jobs may be serviced partially, incurring a penalty; however, only jobs of the same category can be processed simultaneously. One must identify the best subset of jobs to process in each time interval of a given planning horizon while respecting the server capacity and scheduling requirements. We compare the proposed solution methods with a MILP formulation and show that the dynamic programming approach is faster when the number of categories is large, whereas the MILP can be solved faster when the number of categories is small.
26 pages, March 5, 2013
Full text files
dpbe5_2013.pdf Full text
Questions (including download problems) about the papers in this series should be directed to Lene Holbæk ()
Report other problems with accessing this service to Sune Karlsson ().
This page generated on 2018-04-30 13:44:08.