Mixed Integer Programming Models for Two Identical Parallel Machines with a Single Server

Yong Zhan; Hai Tao Zhu; Yu Guang Zhong

doi:10.4028/www.scientific.net/AMR.945-949.3344

Paper Titles

Study on the Impact of Web-Quests as Communication Technology on Electronic Reading
p.3327

Software Quality Evaluation for Control System Based on Extension Theory
p.3331

The Design and Realization of Remote Data Synchronization Based on Configuration Software
p.3336

The Research Status and Prospect of Virtual Community in China
p.3340

Mixed Integer Programming Models for Two Identical Parallel Machines with a Single Server
p.3344

The Design of the Online Collaborative Music Production System
p.3348

Design and Implementation of System Framework Based on Web
p.3353

A Design of Data Fusion Management System Based on LabVIEW
p.3356

The Research of Data Mining Technology in Customer Relationship Management
p.3360

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 945-949Mixed Integer Programming Models for Two Identical...

Mixed Integer Programming Models for Two Identical Parallel Machines with a Single Server

Abstract:

This paper addresses the problem of scheduling jobs on two identical parallel machines with a single server such that the makespan is minimized. Each job can be processed by either one of the two parallel machines, but before processing, a setup operation must be done by a single server. Two mixed integer programming models for the considered scheduling problem are developed using time indexed variable and sequence indexed variable respectively. To evaluate the performance of the two models, CPLEX is used to test instances generated randomly. The results show that the sequence indexed model outperforms on the number of variables and computational time, which can be used to solve the instance of 20 jobs.