Page - 56 - in Algorithms for Scheduling Problems

Algorithms 2018,11, 80 3. Schrage, L. Obtaining Optimal Solutions to Resource Constrained Network Scheduling Problems. Unpublishedwork,1971. 4. Potts, C.N. Analysis of a heuristic for onemachine sequencingwith release dates and delivery times. Oper.Res. 1980,28, 1436–1441. [CrossRef] 5. Hall, L.A.; Shmoys, D.B. Jackson’s rule for single-machine scheduling: Making a goodheuristic better. Mathem.Oper. Res. 1992,17, 22–35. [CrossRef] 6. Nowicki,E.;Smutnicki,C.Anapproximationalgorithmforsingle-machineschedulingwithrelease times anddelivery times.DiscretAppl.Math. 1994,48, 69–79. [CrossRef] 7. Larson,R.E.;Dessouky,M.I.heuristicprocedures for thesinglemachineproblemtominimizemaximum lateness.AIIETrans. 1978,10, 176–183. [CrossRef] 8. Kise,H.; Ibaraki,T.;Mine,H.Performanceanalysisofsixapproximationalgorithmsfor theone-machine maximumlatenessschedulingproblemwithreadytimes. J.Oper. Res. Soc. Japan1979,22,205–223. [CrossRef] 9. Vakhania,N.; Perez,D.; Carballo, L. Theoretical ExpectationversusPractical Performance of Jackson’s heuristic.Math. Probl. Eng. 2015,2015, 484671. [CrossRef] 10. McMahon,G.;Florian,M.Onschedulingwithreadytimesandduedates tominimizemaximumlateness. Oper. Res. 1975,23, 475–482. [CrossRef] 11. Carlier, J.Theone–machinesequencingproblem.Eur. J.Oper. Res. 1982,11, 42–47. [CrossRef] 12. Sadykov,R.;Lazarev,A.Experimentalcomparisonofbranch-and-boundalgorithmsforthe1|rj|Lmaxproblem. InProceedingsof theSeventhInternationalWorkshopMAPSP’05,Siena, Italy, June6–102005;pp. 239–241. 13. Grabowski, J.;Nowicki,E.;Zdrzalka,S.Ablockapproachforsingle-machineschedulingwithreleasedates andduedates.Eur. J.Oper. Res. 1986,26, 278–285. [CrossRef] 14. Larson,M.I.Dessouky andRichardE.DeVor. AForward-BackwardProcedure for the SingleMachine ProblemtoMinimizeMaximumLateness. IIETrans. 1985, 17, 252–260, doi:10.1080/07408178508975300. [CrossRef] 15. Pan,Y.; Shi, L.Branch-and-boundalgorithms for solvinghard instancesof theone-machine sequencing problem.Eur. J.Oper. Res. 2006,168, 1030–1039. [CrossRef] 16. Liu,Z.Singlemachineschedulingtominimizemaximumlatenesssubject toreleasedatesandprecedence constraints.Comput.Oper. Res. 2010,37, 1537–1543. [CrossRef] 17. Gharbi,A.; Labidi,M. Jackson’s Semi-Preemptive SchedulingonaSingleMachine. Comput. Oper. Res. 2010,37, 2082–2088,doi:10.1016/j.cor.2010.02.008. [CrossRef] 18. Lenstra, J.K.; Rinnooy Kan, A.H.G.; Brucker, P. Complexity of machine scheduling problems. Ann.Discret.Math.1977,1, 343–362. 19. Kacem, I.; Kellerer,H.Approximationalgorithms forno idle time schedulingona singlemachinewith release timesanddelivery times. Discret. Appl. Math. 2011,164, 154–160,doi:10.1016/j.dam.2011.07.005. [CrossRef] 20. Lazarev,A.ThePareto-optimalsetof theNP-hardproblemofminimizationof themaximumlateness fora singlemachine. J.Comput. Syst. Sci. Int. 2006,45, 943–949. [CrossRef] 21. Lazarev,A.;Arkhipov,D.;Werner, F. Scheduling JobswithEqualProcessingTimesonaSingleMachine: MinimizingMaximumLatenessandMakespan.Optim. Lett. 2016,11, 165–177. [CrossRef] 22. Carlier, J.;Hermes,F.;Moukrim,A.;Ghedira,K.Exact resolutionof theone-machinesequencingproblem withnomachine idle time.Comp. Ind. Eng. 2010,59, 193–199,doi:10.1016/j.cie.2010.03.007. [CrossRef] 23. Chrétienne,P.Onsingle-machineschedulingwithout intermediatedelays.DiscreteAppl.Math. 2008,156, 2543–2550. [CrossRef] 24. Ehrgott,M.MulticriteriaOptimization;SpringerScience&BusinessMedia:Berlin,Germany,2005;Volume491. 25. Chinos,E.;Vakhania,N.Adjustingschedulingmodelwithreleaseandduedates inproductionplanning. CogentEng. 2017,4, 1–23. [CrossRef] 26. Vakhania,N.Abetter algorithmfor sequencingwith releaseanddelivery timeson identicalprocessors. J.Algorithms2003,48, 273–293. [CrossRef] c©2018bytheauthors. LicenseeMDPI,Basel,Switzerland. Thisarticle isanopenaccess articledistributedunder the termsandconditionsof theCreativeCommonsAttribution (CCBY) license (http://creativecommons.org/licenses/by/4.0/). 56