MIP Models and Hybrid Algorithms for Simultaneous Job Splitting and Scheduling on Unrelated Parallel Machines
We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel alg...
Saved in:
Main Authors: | Duygu Yilmaz Eroglu, H. Cenk Ozmutlu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2014/519520 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Modified artificial fish swarm algorithm to solve unrelated parallel machine scheduling problem under fuzzy environment
by: Azhar Mahdi Ibadi, et al.
Published: (2024-12-01) -
Corrigendum to “Improved Combinatorial Benders Decomposition for a Scheduling Problem with Unrelated Parallel Machines”
by: Francisco Regis Abreu Gomes, et al.
Published: (2017-01-01) -
Exact makespan minimization of unrelated parallel machines
by: Åblad, Edvin, et al.
Published: (2021-05-01) -
Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
by: Lisi Cao, et al.
Published: (2020-01-01) -
Automated generation of dispatching rules for the green unrelated machines scheduling problem
by: Nikolina Frid, et al.
Published: (2024-12-01)