Generalized pairwise interchanges and machine scheduling
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.:
- Tadei, Roberto, 1993. "A note on "minimizing a quadratic function of job lateness on a single machine"," International Journal of Production Economics, Elsevier, vol. 32(2), pages 185-187, September.
- Gupta, Sushil K. & Sen, Tapan, 1983. "Minimizing a quadratic function of job lateness on a single machine," Engineering Costs and Production Economics, Elsevier, vol. 7(3), pages 187-194, September.
- Sen, Tapan & Dileepan, Parthasarati & Ruparel, Bharat, 1990. "Minimizing a generalized quadratic penalty function of job completion times: An improved branch-and-bound approach," Engineering Costs and Production Economics, Elsevier, vol. 18(3), pages 197-202, January.
- Dileepan, Parthasarati & Sen, Tapan, 1991. "Bicriterion jobshop scheduling with total flowtime and sum of squared lateness," Engineering Costs and Production Economics, Elsevier, vol. 21(3), pages 295-299, July.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:83:y:1995:i:2:p:310-319. 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: (Dana Niculescu)
If references are entirely missing, you can add them using this form.