Change search
ReferencesLink to record
Permanent link

Direct link
Optimization of Just-in-Time Sequencing Problems and Supply Chain Logistics
Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. (Mathematics and Applied Mathematics)
2015 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

This dissertation presents a comprehensive and comparative progress in sequencing approaches of mixed-model just-in-time (JIT) sequencing problem together with discrete apportioment problem (DAP). The goal of JIT sequencing problem (JITSP) is to keep the rate of usage of parts as constant as possible along the assembly lines, and the goal of DAP is to divide a given integer number of delegates proportionally among the states or the parties according to their population or votes. Furthermore, the supply chain logistics problem is also reported in here with some real life applications.The single-level JITSP, known as the product rate variation problem (PRVP), is pseudo-polynomially solvable. The total PRVP minimizes sum deviation and the bottleneck PRVP minimizes the maximum deviation between the actual production and the ideal production. The assignment approach solves total PRVP whereas the perfect matching works for bottleneck PRVP solving the problem in pseudo-polynomial time. The multi-level JITSP, known as the output rate variation problem (ORVP), is NP-hard in most of the cases. However, some sequencing heuristics and dynamic programming are devised for near optimal solutions. And the pegging assumption reduces the ORVP into weighted case of PRVP. In this dissertation, the total PRVP with square and absolute deviations are considered and mean-based divisor methods are devised for the equitably efficient solution. The simultaneous dealing to the PRVP and DAP establishes the interlink between the production sequencing problem and integer seat allocating problem. The new upper bottlenecks are investigated and the problems are solved comparatively. The bottleneck PRVP instances for small deviations and cyclic sequences for total PRVP are shown to be optimal. The bicriterion sequencing is discussed with Pareto optimal solutions.The production sequencing problem is simultaneously dealt with supply chain logistics to balance overall supply chain system. The cross-docking supply chain logistics problem is formulated with a proposition to be solved. The real-world applications of JITSP and supply chain are listed and some open problems are pointed out as the closing of the dissertation.

Place, publisher, year, edition, pages
Västerås: Mälardalen University , 2015. , 184 p.
Mälardalen University Press Dissertations, ISSN 1651-4238 ; 184
Keyword [en]
Just-in-time, JIT sequencing, apportionment, product rate variation, output rate variation, algorithms, heuristics, supply chain, logistics, queueing, non-linear integer programming
National Category
Computational Mathematics
Research subject
Mathematics/Applied Mathematics
URN: urn:nbn:se:mdh:diva-28849ISBN: 978-91-7485-227-1OAI: diva2:851513
Public defence
2015-10-12, Kappa, Mälardalens högskola, Västerås, 13:15 (English)
Available from: 2015-09-07 Created: 2015-09-05 Last updated: 2015-10-05Bibliographically approved

Open Access in DiVA

fulltext(2671 kB)325 downloads
File information
File name FULLTEXT01.pdfFile size 2671 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Thapa, Gyan
By organisation
Educational Sciences and Mathematics
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 325 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 749 hits
ReferencesLink to record
Permanent link

Direct link