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

2013 ◽  
Author(s):  
Van Huy Nguyen ◽  
Nguyen Huynh Tuong ◽  
Van Hoai Tran ◽  
Nam Thoai
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Makespan Minimization ◽  
Availability Constraints

scholarly journals A single machine scheduling problem with availability constraints and sequence-dependent setup costs

2011 ◽  
Vol 35 (4) ◽  
pp. 2041-2050 ◽  
Author(s):  
Francisco Ángel-Bello ◽  
Ada Álvarez ◽  
Joaquín Pacheco ◽  
Iris Martínez
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Setup Costs ◽  
Sequence Dependent ◽  
Availability Constraints ◽  
Sequence Dependent Setup ◽  
Sequence Dependent Setup Costs

scholarly journals Single-machine Scheduling with Splitable Jobs and Availability Constraints

2013 ◽  
Vol 3 (1-2) ◽  
Author(s):  
Van Huy Nguyen ◽  
Nguyen Huynh Tuong ◽  
Hua Phung Nguyen ◽  
Thanh Hien Nguyen
Keyword(s):  
Lower Bound ◽  
Single Machine ◽  
Heuristic Algorithms ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Strong Sense ◽  
Scheduling Problem ◽  
Computational Results ◽  
Feasible Schedule ◽  
Availability Constraints

This paper deals with a single machine scheduling problem with availability constraints. The jobs are splitable and lower bound on the size of each sub-job is imposed. The objective is to find a feasible schedule that minimizes the makespan. The proposed scheduling problem is proved to be NP-hard in the strong sense. Some effective heuristic algorithms are then proposed. Additionally, computational results show that the proposed heuristic performs well.

Single machine scheduling problem with fuzzy precedence relation

1995 ◽  
Vol 87 (2) ◽  
pp. 284-288 ◽  
Author(s):  
Hiroaki Ishii ◽  
Minoru Tada
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Precedence Relation

A New Heuristic for a Single Machine Scheduling Problem with Set-Up Times

1996 ◽  
Vol 47 (1) ◽  
pp. 175 ◽  
Author(s):  
David Williams ◽  
Andrew Wirth
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Set Up
Sign in / Sign up

Export Citation Format

Share Document