Skip to content
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Publication Details
AFRICAN RESEARCH NEXUS
SHINING A SPOTLIGHT ON AFRICAN RESEARCH
computer science
Scheduling on parallel machines with preemption and transportation delays
Computers and Operations Research, Volume 39, No. 2, Year 2012
Notification
URL copied to clipboard!
Description
This paper deals with an identical parallel machines scheduling problem, where independent jobs can be preempted and transported from one machine to another. The transportation of a preempted job requires a time called the transportation delay. The goal is to find a solution that minimizes the total completion time (makespan). We first study the case of equal-size jobs where new complexity results are given. Then, to solve the problem with two identical machines, we present a dynamic programming algorithm and a fully polynomial time approximation scheme (FPTAS). Experimental results show the efficiency of the FPTAS compared to a previously published heuristic. © 2011 Elsevier Ltd.
Authors & Co-Authors
Haned, Amina
Algeria, Algiers
University of Dely Brahim
Algeria, Algiers
Université Des Sciences et de la Technologie Houari Boumediene
Soukhal, Ameur
France, Tours
Université de Tours
Boudhar, Mourad
Algeria, Algiers
Université Des Sciences et de la Technologie Houari Boumediene
Huynh Tuong, Nguyen
Viet Nam, Ho Chi Minh City
University of Technology
Statistics
Citations: 17
Authors: 4
Affiliations: 4
Identifiers
Doi:
10.1016/j.cor.2011.04.013
ISSN:
03050548