By Topic

Job batching and scheduling for parallel non-identical machines via MILP and Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ralf Fröhlich ; Institute of Automation, Hamburg University of Technology, Hamburg, Germany ; Matthias Hüsig

This paper presents two modeling approaches for batching and scheduling jobs on parallel non-identical machines. For scheduling of jobs the due dates as a hard restriction and machine dependent processing times are considered. Between each of the jobs a setup may be necessary or not, depending on the predecessor. The setup of the machines is done by a single worker who needs to be scheduled as well, since only he can serve one machine at a time. The objective is to maximize the overall workload of the machines meeting the constraint of the due dates. While the first approach uses mixed integer linear programming to calculate an optimal schedule, the second one uses a simulation, based on colored Petri nets. Both methods are tested and evaluated using illustrative simulation examples.

Published in:

Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on

Date of Conference:

11-14 Oct. 2009