Page - 73 - in Algorithms for Scheduling Problems

Algorithms 2018,11, 43 7. Ríos-Solís, Y.A.; Ríos-Mercado,R.Z. Just-In-Time Systems; Springer Sciences: NewYork,NY,USA, 2012; ISBN978-1-4614-1122-2. 8. Shabtay,D.;Steiner,G.Schedulingtomaximize thenumberof just-in-time jobs:Asurvey. In Just-in-Time Systems; Ríos-Solís, Y.A., Ríos-Mercado, R.Z., Eds.; Springer Sciences: New York, NY, USA, 2012; ISBN978-1-4614-1122-2. 9. Choi, B.-C.; Yoon, S.-H.Maximizing theweightednumber of just-in-time jobs inflowshop scheduling. J.Sched. 2007,10, 237–243. [CrossRef] 10. Shabtay,D.;Bensoussan,Y.Maximizingtheweightednumberof just-in-time jobs inseveral two-machine schedulingsystems. J.Sched. 2012,15, 39–47. [CrossRef] 11. Shabtay,D.The just-in-timeschedulingprobleminaflow-shopschedulingsystem.Eur. J.Oper. Res. 2012, 216, 521–532. [CrossRef] 12. Gerstl, E.; Mor, B.; Mosheiov, G. A note: Maximizing theweighted number of just-in-time jobs on a proportionateflowshop. Inf. Process. Lett. 2015,115, 159–162. [CrossRef] 13. Yin,Y.;Cheng,T.C.E.;Wang,D.-J.;Wu,C.-C.Two-agentflowshopscheduling tomaximize theweighted numberof just-in-time jobs. J.Sched. 2017,20, 313–335. [CrossRef] 14. Fuchigami,H.Y.;Rangel,S.Métodosheurísticosparamaximizaçãodonúmerodetarefas just-in-timeemflow shoppermutacional. InProceedingsof theSimpósioBrasileirodePesquisaOperacional,PortodeGalinhas, Brazil, 25–28August2015. 15. Fuchigami, H.Y.; Rangel, S. Um estudo computacional de um modelo matemático para flow shop permutacionalcomtarefas just-in-time. InProceedingsof theSimpósioBrasileirodePesquisaOperacional, Vitória,Brazil, 27–30September2016. 16. Dhouib,E.;Teghem,J.;Loukil,T.Minimizingthenumberof tardyjobsinapermutationflowshopscheduling problemwithsetuptimesandtimelagsconstraints. J.Math.Model. Algorithm2013,12, 85–99. [CrossRef] 17. Nawaz,M.;Enscore,E.E., Jr.;Ham, I.Aheuristicalgorithmfor them-machinen-jobflow-shopsequencing problem.OMEGA–Int. J.Manag. Sci. 1983,11, 91–95. [CrossRef] 18. Hodgson,T.J.Anoteonsinglemachinesequencingwithrandomprocessing times.Manag. Sci. 1977,23, 1144–1146. [CrossRef] 19. Baker,K.R.;Trietsch,D.Principles ofSequencingandScheduling; JohnWiley&Sons:NewYork,NY,USA,2009; ISBN978-0-470-39165-5. 20. Nagano,M.S.;Branco,F.J.C.B.;Moccellin, J.V.Soluçõesdealtodesempenhoparaprogramaçãodaprodução flowshop.GEPROS2009,4, 11–23. 21. Li,X.;Chen,L.;Xu,H.;Gupta, J.N.D.Trajectory schedulingmethods forminimizing total tardiness ina flowshop.Oper. Res. Perspect. 2015,2, 13–23. [CrossRef] 22. Vallada,E.;Ruiz,R.;Minella,G.Minimizingtotal tardiness in them-machineflowshopproblem:Areview andevaluationofheuristicsandmetaheuristics.Comput.Oper. Res. 2008,35, 1350–1373. [CrossRef] 23. Ronconi, D.P.; Birgin, E.G. Mixed-integer programming models for flow shop scheduling problems minimizingthetotalearlinessandtardiness. In Just-in-TimeSystems;Ríos-Solís,Y.A.,Ríos-Mercado,R.Z., Eds.; SpringerSciences:NewYork,NY,USA,2012; ISBN978-1-4614-1122-2. 24. Taillard,E.Benchmarks forbasicschedulingproblems.Eur. J.Oper. Res. 1993,64, 278–285. [CrossRef] 25. Laha,D.; Sarin, S.C.Aheuristic tominimize total flow time inpermutationflowshop. OMEGA–Int. J. Manag.Sci. 2009,37, 734–739. [CrossRef] ©2018bytheauthors. LicenseeMDPI,Basel,Switzerland. Thisarticle isanopenaccess articledistributedunder the termsandconditionsof theCreativeCommonsAttribution (CCBY) license (http://creativecommons.org/licenses/by/4.0/). 73