27
Views
6
CrossRef citations to date
0
Altmetric
General Paper

Minimizing the number of early jobs on a proportionate flowshop

&
Pages 1426-1429 | Received 07 Aug 2014, Accepted 07 Oct 2014, Published online: 21 Dec 2017

References

  • Gerstl E, Mor B and Mosheiov G (2014). A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Information Processing Letters. Available online 16 September doi:10.1016/j.ipl.2014.09.004.
  • Huang RH and Yang CL (2007). Single-machine scheduling to minimize the number of early jobs. Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2–4 December, pp. 955, 957, doi: 10.1109/IEEM.2007.4419333.
  • Jackson JR (1955). Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles, CA.
  • KanetJJTactically delayed versus non-delay scheduling: An experimental investigationEuropean Journal of Operational Research19862419910510.1016/0377-2217(86)90015-9
  • MondenYToyota Production System: An Integrated Approach to Just-In-Time2011
  • MooreJMAn n job, one machine sequencing algorithm for minimizing the number of late jobsManagement Science196815110210910.1287/mnsc.15.1.102
  • MorBMosheiovGPolynomial time solutions for scheduling problems on a proportionate flowshop with two competing agentsJournal of the Operational Research Society201465115115710.1057/jors.2013.9
  • Mor B and Mosheiov G (2014b). A note: Minimizing maximum earliness on a proportionate flowshop. Information Processing Letters. Available online 2 October, doi: 10.1016/j.ipl.2014.09.023.
  • PanwalkarSSSmithMLKoulamasCReview of ordered and proportionate flow shop scheduling researchNaval Research Logistics2013601465510.1002/nav.21518
  • PinedoMLScheduling: Theory, Algorithms and Systems2012
  • SchallerJValenteJMSAn evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardinessJournal of the Operational Research Society201264680581610.1057/jors.2012.94
  • ShabtayDThe just-in-time scheduling problem in a flow-shop scheduling systemEuropean Journal of Operational Research2012216352153210.1016/j.ejor.2011.07.053
  • ShakhlevichNHoogeveenHPinedoMMinimizing total weighted completion time in a proportionate flow shopJournal of Scheduling19981315716810.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y
  • SprecherAKolischRDrexlASemi-active, active, and non-delay schedules for the resource-constrained project scheduling problemEuropean Journal of Operational Research19958019410210.1016/0377-2217(93)E0294-8

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.