66
Views
15
CrossRef citations to date
0
Altmetric
Theoretical Paper

Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time

, &
Pages 1263-1274 | Received 01 Jan 2002, Accepted 01 Aug 2003, Published online: 21 Dec 2017

References

  • ChenCBulfinRLComplexity of single machine, multi-criteria scheduling problemsEur J Opl Res19937011512510.1016/0377-2217(93)90236-G
  • LeeC-YVairaktarakisGLComplexity of single machine hierarchical scheduling: a surveyComplexity in Numerical Optimization1993269298
  • NagarAHaddockJHeraguSMultiple and bicriteria scheduling: a literature surveyEur J Opl Res1995818810410.1016/0377-2217(93)E0140-S
  • T'KindtVBillautJ-CMulticriteria Scheduling: Theory, Models, and Algorithms2002
  • RojanasoonthonSBardJFReddySDAlgorithms for parallel machine scheduling: a case study of the tracking and data relay satellite systemJ Opl Res Soc20035480682110.1057/palgrave.jors.2601575
  • GuptaJNDHoJCWebsterSBicriteria optimization of makespan and mean flowtime on two identical parallel machinesJ Opl Res Soc2000511330133910.1057/palgrave.jors.2601016
  • AzizogluMKoksalanMKoksalanSKScheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowedJ Opl Res Soc20035466166410.1057/palgrave.jors.2601478
  • ChengTCEChenZ-LParallel-machine scheduling problems with earliness and tardiness penaltiesJ Opl Res Soc19944568569510.1057/jors.1994.106
  • ChengTCESinCCSA state of the art review of parallel machine schedulingEur J Opl Res19904727129210.1016/0377-2217(90)90215-W
  • ChenBPottsCNWoegingerGJA review of machine scheduling: complexity, algorithms and applicationsHandbook of Combinatorial Optimization199821169
  • ConwayRWMaxwellWLMillerLWTheory of Scheduling1976
  • Bruno J, Coffman EG and Sethi R (1974). Scheduling algorithms to minimize mean flow-time. In: Rosenfeld JL (ed). Proceedings of the IFIP Congress, Vol. 74. North-Holland: Amsterdam, pp 504–510.
  • GareyMRJohnsonDSComplexity results for multiprocessor scheduling under resource constraintsSIAM J Comput1975439741110.1137/0204035
  • BruckerPScheduling Algorithms1995
  • HoJCChangYLMinimizing the number of tardy jobs for m parallel machinesEur J Opl Res19958434335510.1016/0377-2217(93)E0280-B

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.