The job shop tardiness problem: A decomposition approach
dc.contributor.author | Raman, Narayan | en_US |
dc.contributor.author | Brian Talbot, F. | en_US |
dc.date.accessioned | 2006-04-10T15:35:44Z | |
dc.date.available | 2006-04-10T15:35:44Z | |
dc.date.issued | 1993-09-10 | en_US |
dc.identifier.citation | Raman, N., Brian Talbot, F. (1993/09/10)."The job shop tardiness problem: A decomposition approach." European Journal of Operational Research 69(2): 187-199. <http://hdl.handle.net/2027.42/30576> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6VCT-48NBGX1-21G/2/df35b0aa1aec354f89b32549d743db9d | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/30576 | |
dc.description.abstract | An important criterion for evaluating the effectiveness of many manufacturing firms is their ability to meet due dates. In low to medium volume discrete manufacturing, typified by traditional job shops and more recently by flexible manufacturing systems, this criterion is usually operationalized on the shop floor through the use of prioritizing dispatching rules. The widespread use of dispatching rules has led to a number of investigations where the due date performance of various rules is compared. In contrast to previous research on dispatching rules, this paper proposes a new approach that decomposes the dynamic problem into a series of static problems. These static problems are solved in their entirely, and then implemented dynamically on a rolling basis. To illustrate this approach, a specific heuristic is developed that constructs the schedule for the entire system by focusing on the bottleneck machine. Computational results indicate that significant due date performance improvement over traditional dispatching rules can be obtained by using this new approach. | en_US |
dc.format.extent | 920493 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | The job shop tardiness problem: A decomposition approach | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | School of Business Administration, The University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.contributor.affiliationother | Department of Business Administration, University of Illinois at Urbana-Champaign, Champaign, IL 61820, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/30576/1/0000211.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0377-2217(93)90163-H | en_US |
dc.identifier.source | European Journal of Operational Research | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.