Multi-item scheduling problem with overtime : surrogate relaxations and heuristics
dc.contributor.author | Ben-Kheder, Nejib. | en_US |
dc.contributor.author | Yano, Candace Arai | en_US |
dc.date.accessioned | 2006-02-03T18:27:40Z | |
dc.date.available | 2006-02-03T18:27:40Z | |
dc.date.issued | 1990 | en_US |
dc.identifier | UMR4731 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/3538 | |
dc.format.extent | 32 bytes | |
dc.format.extent | 58504 bytes | |
dc.format.extent | 3366 bytes | |
dc.format.extent | 67580 bytes | |
dc.format.extent | 2410350 bytes | |
dc.format.mimetype | text/plain | |
dc.format.mimetype | text/plain | |
dc.format.mimetype | text/plain | |
dc.format.mimetype | text/plain | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | en_US |
dc.subject | Scheduling (Management) | en_US |
dc.subject | Linear programming. | en_US |
dc.subject | Algorithms. | en_US |
dc.subject | Engineering economy. | en_US |
dc.title | Multi-item scheduling problem with overtime : surrogate relaxations and heuristics | en_US |
dc.type | Technical Report | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/3538/5/ban3101.0001.001.pdf | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/3538/4/ban3101.0001.001.txt | en_US |
dc.owningcollname | Engineering, College of - Technical Reports |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available 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.