Record Details
 
  « New Search    
   
 
Bibliographic Data
001
  
313775
005
  
20150706095031.AM
008
  
150706s |||||||||b ||00|||
040
##
$aSTII-DOST
090
##
$aScienceDirect
100
1#
$a Ji-Bo Wang
100
1#
$a Lin-Hui Sun
100
1#
$aLin-Yan Sun
100
1#
$aLing Wang
245
00
$aOn three-machine flow shop scheduling with deteriorating jobs$cby Ling Wang and 3 others
260
##
$aAmsterdam$bElsevier B.V.$c2010
300
##
$apages 185-189$bcomputer file; text; 163kb
504
##
$aIncludes bibliographical references
520
3#
$aIn this paper, we consider a three-machine permutation flow shop scheduling problem under simple linear deterioration. By a simple linear deterioration function, we mean that the processing time of a job is a simple linear function of its execution start time. The objective is to find a sequence that minimizes makespan. This problem is well known NP-hard. Optimal schedules are obtained for some special cases. For the general case, several dominance properties and two lower bounds are derived to speed up the elimination process of a branch-and-bound algorithm. Moreover, a heuristic algorithm is proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational experiments on randomly generated problems is conducted to evaluate the branch-and-bound algorithm and heuristic algorithm. The analysis shows that the proposed heuristic algorithm performs effectively and efficiently.
650
04
$aSocial sciences
650
04
$aAlgorithms$xAnalysis
650
04
$aManagement science$xAnalysis
650
04
$aBranch-and-bound algorithm
852
##
$aDOST$bSTII$hScienceDirect$jNONPRINTS$kNP$p14-16397$t1$x14-16397$yOnline/Download$12012-01-24
991
##
$wNONPRINTS
  
     
 
Physical Location
Department of Science and Technology
Science and Technology Information InstituteScienceDirect
  
     
 
Digital Copy
Not Available
  
     
  |  Download MARC record Download MARC
 
         
         
Online Catalog
Basic Search
Advanced Search
Browse Subjects
Book Cart
 
         

Text Size:
S  -  M  -  L
Copyright © 2004-2025. Philippine eLib Project
Host: U.P. Diliman University Library