article · Journal of the Operational Research Society · 2011

A note on parallel-machine due-window assignment

Cited by 1Abstract and details only

Abstract

We consider a due-window assignment problem on identical parallel machines, where the jobs have equal processing times and job-dependent earliness-tardiness costs. We would like to determine a ‘due window’ during which the jobs can be completed at no cost and to obtain a job schedule in which the jobs are penalized if they finish before or after the due window. The objective is to minimize the total earliness and tardiness job penalty, plus the cost associated with the size of the due window. We present an algorithm that can solve this problem in O(n3) time, which is an improvement of the O(n4) solution procedure developed by Mosheiov and Sarig.

Cite this paper

APA 7

Xu, D., Li, C., & Han, Q. (2011). A note on parallel-machine due-window assignment. Journal of the Operational Research Society, 63(6), 821–825. https://doi.org/10.1057/jors.2011.75

MLA 9

Xu, Dan, et al. “A note on parallel-machine due-window assignment.” Journal of the Operational Research Society, vol. 63, no. 6, 2011, pp. 821–25, https://doi.org/10.1057/jors.2011.75.

Chicago

Xu, Dan, Chung‐Lun Li, and Qiaoming Han. 2011. “A note on parallel-machine due-window assignment.” Journal of the Operational Research Society 63 (6): 821–25. https://doi.org/10.1057/jors.2011.75.

Harvard

Xu, D., Li, C. and Han, Q. (2011) ‘A note on parallel-machine due-window assignment’, Journal of the Operational Research Society, 63(6), pp. 821–825. Available at: https://doi.org/10.1057/jors.2011.75.

BibTeX

@article{xu2011note,
  title = {{A note on parallel-machine due-window assignment}},
  author = {Xu, Dan and Li, Chung‐Lun and Han, Qiaoming},
  journal = {Journal of the Operational Research Society},
  volume = {63},
  number = {6},
  pages = {821--825},
  year = {2011},
  doi = {10.1057/jors.2011.75}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.