64
Views
31
CrossRef citations to date
0
Altmetric
Original Articles

Parallel-Machine Batching and Scheduling to Minimize Total Completion Time

, , &
Pages 953-956 | Received 01 Oct 1994, Accepted 01 Nov 1995, Published online: 13 Sep 2016

References

  • Albers, A. and Brucker, P. (1993) The complexity of one-machine batching problems. Discrete Applied Mathematics, 47, 87–107.
  • Brucker, P. and Kovalyov, M.Y. (1996) Single machine batch scheduling to minimize the weighted number of late jobs. Zeitschrift für Operations Research (submitted).
  • Cheng, T.C.E., Chen, Z.-L. and Oguz, C. (1994) One-machine batching and sequencing of multiple-type items. Computers and Operations Research, 21, 717–721.
  • Cheng, T.C.E. and Kovalyov, M.Y. (1996) Single machine batch scheduling with deadlines and resource dependent processing times. Operations Research Letters, 17, 243–249.
  • Coffman, E.G., Jr, Nozari, A. and Yannakakis, M. (1989) Optimal scheduling of products with two subassemblies on a single machine. Operations Research, 37, 426–436.
  • Coffman, E.G., Jr, Yannakakis, M., Magazine, M.J. and Santos, C. (1990) Batch sizing and job sequencing on a single machine. Annals of Operations Research, 26, 135–147.
  • Groover, M.P. (1980) Automation, Production Systems, and Computer-Integrated Manufacturing, Prentice-Hall, Eaglewood Cliffs, NJ.
  • Hochbaum, D.S. and Landy, D. (1994) Scheduling with batching: minimizing the weighted number of tardy jobs. Operations Research Letters, 16, 79–86.
  • Kovalyov, M.Y., Potts, C.N. and Van Wassenhove, L.N. (1991) Single machine scheduling with set-ups to minimize the number of late items: algorithms, complexity and approximation. Report, Econometric Institute, Erasmus University, Rotterdam.
  • Naddef, D. and Santos, C. (1988) One-pass batching algorithms for the one-machine problem. Discrete Applied Mathematics, 21, 133–146.
  • Potts, C.N. and Van Wassenhove, L.N. (1991) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. Journal of the Operational Research Society, 43, 395–406.
  • Shallcross, D.F. (1992) A polynomial algorithm for a one machine batching problem. Operations Research Letters, 11, 213–218.
  • Tang, C. (1990) Scheduling batches with major and minor set-ups. European Journal of Operations Research, 46, 28–37.
  • Tang, C. and Denardo, E. (1988) Models arising from a flexible manufacturing machine, part II. Minimization of the number of switching instants. Operations Research, 36, 778–784.
  • Wittrock, R. (1986) Scheduling parallel machines with set-ups. Research report, IBM T.J. Watson Research Center, Yorktown Heights, NY.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.