Block models for scheduling jobs on two parallel machines with a single server |
| |
Affiliation: | 1. Division of Knowledge and System Engineering for ICT (KSE-ICT), Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam;2. Analysis, Design and Development of ICT systems (AddICT) Laboratory, Budapest University of Technology and Economics, H-117, Magyar tudósok körútja 2., Budapest, Hungary |
| |
Abstract: | We consider the problem of scheduling a set of non-preemptable jobs on two identical parallel machines such that the makespan is minimized. Before processing, each job must be loaded on a machine, which takes a given setup time. All these setups have to be done by a single server which can handle at most one job at a time. For this problem, we propose a mixed integer linear programming formulation based on the idea of decomposing a schedule into a set of blocks. We compare the results obtained by the model suggested with known heuristics from the literature. |
| |
Keywords: | Scheduling Parallel machines Single server |
本文献已被 ScienceDirect 等数据库收录! |
|