Modelling and an SS Approach for the Parallel Production Lines Scheduling Problem

DOI

10.2991/ceis-16.2016.49How to use a DOI?

Keywords

parallel machine; scheduling; Scatter Search; integer programming

Abstract

A special parallel machine scheduling problem is studied and formulated into a mixed integer programming model, considering setup time and time window. A valid inequality is deduced and improved with the setup time consideration. An relaxed IP model with valid inequality can provide a primary cable assignment scheme and lower bound to the scheduling problem. A SS algorithm is proposed to solve the problem. At last, the numerical experiments is carried out which demonstrates that the proposed solution approach is effective and efficient.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hui-Zhi Ren
AU  - Han Xu
PY  - 2016/11
DA  - 2016/11
TI  - Modelling and an SS Approach for the Parallel Production Lines Scheduling Problem
BT  - Proceedings of the 2016 International Conference on Computer Engineering and Information Systems
PB  - Atlantis Press
SP  - 250
EP  - 254
SN  - 2352-538X
UR  - https://doi.org/10.2991/ceis-16.2016.49
DO  - 10.2991/ceis-16.2016.49
ID  - Ren2016/11
ER  -