Articles liés à Mixed-model Just-in-time Sequencing Problem: Sequencing...

Mixed-model Just-in-time Sequencing Problem: Sequencing approaches of mixed-model just-in-time production systems - Couverture souple

Khadka, Shree Ram

 
9783659001963: Mixed-model Just-in-time Sequencing Problem: Sequencing approaches of mixed-model just-in-time production systems
Couverture souple
ISBN 10 : 3659001961 ISBN 13 : 9783659001963
Editeur : LAP LAMBERT Academic Publishing, 2012

Synopsis

This dissertation describes an extensive account of and advances in sequencing approaches of the mixed-model just-in-time sequencing problem with the goal of keeping the rate of usage of parts as constant as possible. The description of the sequencing approaches is helpful since it gives a thorough and easily readable overview of the existing literature. It contains numerous new results, which have been accepted in international journals, as well. The multi-level case of the problem is NP-hard. However, the single-level case (with significant or negligible change-over time and arbitrary or unit processing time) is polynomially solvable depending on the size of the instance. The dissertation describes several heuristics also. It contains the discussion of some related problems. Moreover, a number of unsolved problems have been given for future research.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

This dissertation describes an extensive account of and advances in sequencing approaches of the mixed-model just-in-time sequencing problem with the goal of keeping the rate of usage of parts as constant as possible. The description of the sequencing approaches is helpful since it gives a thorough and easily readable overview of the existing literature. It contains numerous new results, which have been accepted in international journals, as well. The multi-level case of the problem is NP-hard. However, the single-level case (with significant or negligible change-over time and arbitrary or unit processing time) is polynomially solvable depending on the size of the instance. The dissertation describes several heuristics also. It contains the discussion of some related problems. Moreover, a number of unsolved problems have been given for future research.

Biographie de l'auteur

Shree Ram Khadka received his PhD in mathematics from Tribhuvan University, Nepal in 2011. He is an assistant professorin the central department of mathematics, Tribhuvan University. He is actively involved in teaching and research in the field of optimization.He has published a number of research papers in some international journals.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2012
Langue
anglais
ISBN 10 
3659001961
ISBN 13 
9783659001963
Reliure
Broché
Nombre de pages
140
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne