By Topic

Scheduling parallel multiple capacitated machines with sequence-dependent constraint

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

3 Author(s)
Yanyan, Zhao ; School of Economics and Management, University of Science and Technology Beijing Beijing, China ; Tieke, Li ; Bailin, Wang

This paper introduces a new kind of parallel machines scheduling problem. Each job has a minimal processing time and all the machines are multiple capacitated machines in this problem. Each machine can process at most β jobs simultaneously according to the First-In-First-Out discipline, and the completion sequence and completion time interval between two jobs are restricted by the plan. A CSP model and a heuristic algorithm are put forward. The algorithm contains two stages, in the first stage, a method of job assignment based on expected starting time is presented; and in the second stage, the timetable is output to minimize the objective function. Computational tests reflect that both the model and the heuristic are feasible and efficient.

Published in:

E -Business and E -Government (ICEE), 2011 International Conference on

Date of Conference:

6-8 May 2011