Cart (Loading....) | Create Account
Close category search window

An MILP-based makespan minimization model for single-machine scheduling problem with splitable jobs and availability constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nguyen, Van Huy ; Faculty of Computer Science & Engineering, Ho Chi Minh city University of Technology, Vietnam 268 Ly Thuong Kiet, Ho Chi Minh, Vietnam ; Tuong, Nguyen Huynh ; Tran, Van Hoai ; Thoai, Nam

This paper investigates the performance of several solvers for mixed-integer linear programming (MILP) on a scheduling problem with job splitting properties and availability constraints. The jobs are splitable and lower bound on the size of each sub-job is imposed. The scheduling objective aims to find a feasible schedule that minimizes the makespan. This scheduling problem is known as NP-hard in the strong sense [9]. In this paper, a mixed-integer linear mathematical model is constructed based on some structurally optimal properties. Some solvers such as GLPK, COIN-OR CBC and Gurobi are used to test the performance of the proposed model. For solving the considered scheduling problem, the best implemented MILP solver with its branch-and-cut parameters will be determined through computational results.

Published in:

Computing, Management and Telecommunications (ComManTel), 2013 International Conference on

Date of Conference:

21-24 Jan. 2013

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.