Cyclic Sequences for Min-Max Objective in MixedModel Just-in-Time Production System
| dc.contributor.author | Pandey, Bishnu Prasad | |
| dc.date.accessioned | 2023-07-03T09:38:10Z | |
| dc.date.available | 2023-07-03T09:38:10Z | |
| dc.date.issued | 2009 | |
| dc.description.abstract | Cyclic scheduling has received considerable attention in recent years as an effectivetechnique for repetitive manufacturing.Cyclic scheduling has been primarily studiedunder deterministic assumptions. In practice, stochastic variability exists and must betaken into account. The cyclic scheduling problems that arise in manufacturing arestudied in this dissertation. Starting with practical Just-in-Time sequencing problem withgiven set of sequences as precedence constraints, efficient algorithm which obtains anoptimal solution for the maximum deviation objective in the single level is studied. Fromthis study, formulation for solving min-max-absolute-chainproblem in cyclic paradigm isintroduced. Moreover, the study purposes algorithms for implementation of cyclicversion of min-max-absolute-chain problem. With its implementation, repetitivemanufacturing industry could benefit. | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.14540/18354 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Department of Computer Science and Information Technology | en_US |
| dc.subject | production system. | en_US |
| dc.subject | Cyclic scheduling | en_US |
| dc.title | Cyclic Sequences for Min-Max Objective in MixedModel Just-in-Time Production System | en_US |
| dc.type | Thesis | en_US |
| local.academic.level | Masters | en_US |
| local.institute.title | Central Department of Computer Science and Information Technology | en_US |
Files
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: