Loading...
Loading...

Go to the content (press return)

An algorithm for a bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs

Author
Mateo, M.; Teghem, J.; Tuyttens, D.
Type of activity
Journal article
Journal
IFAC-PapersOnLine
Date of publication
2016-01-01
Volume
49
Number
12
First page
1614
Last page
1619
DOI
https://doi.org/10.1016/j.ifacol.2016.07.811 Open in new window
Repository
http://hdl.handle.net/2117/97109 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S2405896316310941 Open in new window
Abstract
The scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not always all the jobs can be manufactured in any machine and the eligibility appears. Based on a real-life problem, we present a model which has three different machines, called as high, medium and low level respectively. The set of jobs to be scheduled on these three parallel machines are also distributed among these three levels: one job from a level can be manufactured in a machine of the same or hi...
Citation
Mateo, M., Teghem, J., Tuyttens, D. An algorithm for a bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs. "IFAC-PapersOnLine", 1 Gener 2016, vol. 49, núm. 12, p. 1614-1619.
Keywords
Pareto front, delivery times, eligibility, multi-objective optimization, parallel machines, release dates, scheduling
Group of research
SCOM - Supply Chain and Operations Management

Participants

Attachments