Result: Minimizing total completion time in a two-machine flow shop with deteriorating jobs
Title:
Minimizing total completion time in a two-machine flow shop with deteriorating jobs
Authors:
Source:
Applied mathematics and computation. 180(1):185-193
Publisher Information:
New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 24 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse mathématique, Mathematical analysis, Calcul des variations et contrôle optimal, Calculus of variations and optimal control, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Optimisation. Problèmes de recherche, Optimization. Search problems, Ordonnancement, Scheduling, sequencing, Atelier monogamme, Flow shop, Atelier multigamme, Job shop, Borne inférieure, Lower bound, Cota inferior, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Ordonnancement, Scheduling, Reglamento, Solution optimale, Optimal solution, Solución óptima, Temps exécution, Execution time, Tiempo ejecución, Temps traitement, Processing time, Tiempo proceso, Algorithme heuristique, Heuristic algorithm, Détérioration linéaire simple, Simple linear deterioration, Méthode branch and bound, Temps complétion totale, Total completion time, Branch-and-bound algorithm
Document Type:
Academic journal
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110034, China
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong-Kong
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong-Kong
ISSN:
0096-3003
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Operational research. Management
Operational research. Management
Accession Number:
edscal.18357072
Database:
PASCAL Archive
Further Information
This paper considers a two-machine flow shop scheduling problem with deteriorating jobs. By a deteriorating job, we mean that the processing time of a job is an increasing function of its execution start time. A simple linear deterioration function is assumed. The objective is to find a sequence that minimizes total completion time. Optimal solutions 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. A heuristic algorithm is also proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational results show that the proposed heuristic algorithm performs effectively and efficiently.