Record Details
 
  « New Search    
   
 
Bibliographic Data
Control Number313775
Date and Time of Latest Transaction20150706095031.AM
General Information150706s |||||||||b ||00|||
Cataloging SourceSTII-DOST
Local Call NumberScienceDirect
Main Entry - Personal NameJi-Bo Wang
 Lin-Hui Sun
 Lin-Yan Sun
 Ling Wang
Title StatementOn three-machine flow shop scheduling with deteriorating jobs by Ling Wang and 3 others
Physical Descriptionpages 185-189 computer file; text; 163kb
Summary, Etc.In 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
Subject Added Entry - Topical TermSocial sciences
 Algorithms -- Analysis
 Management science -- Analysis
 Branch-and-bound algorithm
LocationDOST STII ScienceDirect NONPRINTS NP 14-16397 1 14-16397 Online/Download 2012-01-24
  
     
 
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