Scheduling jobs within time windows on identical parallel machines: New model and algorithms
No abstract is available for this item.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kolen, Antoon W. J. & Kroon, Leo G., 1993. "On the computational complexity of (maximum) shift class scheduling," European Journal of Operational Research, Elsevier, vol. 64(1), pages 138-151, January.
- Jansen, Klaus, 1994. "An approximation algorithm for the license and shift class design problem," European Journal of Operational Research, Elsevier, vol. 73(1), pages 127-131, February.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:83:y:1995:i:2:p:320-329. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.