| Completion Time and Precedence |
no parameters |
(
26
26. ABDUL-RAZAQ TS & ALI FH. 2016. Algorithms for scheduling a single machine to minimize total completion time and total tardiness. basrah journal of science, 34(2A): 113-132.
), (
7
7. ADAMU MO & ADEWUMI AO. 2014. A survey of single machine scheduling to minimize weighted number of tardy jobs. Journal of Industrial and Management Optimization, 10(1): 219-241.
), (
5
5. KEHA AB, KHOWALA K & FOWLER JW. 2009. Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1): 357-367. ISSN 0360-8352.
),
|
|
|
(
27
27. M’HALLAH R & ALHAJRAF A. 2016. Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem. Journal of Scheduling , 19(2): 191-205.
), (
28
28. MANNE AS. 1959. On the job shop scheduling problem. Cowles Foundation Discussion Papers 73, Cowles Foundation for Research in Economics, Yale University.
)
|
|
rj and no s
ij
|
(
7
7. ADAMU MO & ADEWUMI AO. 2014. A survey of single machine scheduling to minimize weighted number of tardy jobs. Journal of Industrial and Management Optimization, 10(1): 219-241.
), (
29
29. BALAKRISHNAN N, KANET JJ & SRIDHARAN SV. 1999. Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Comp. Oper. Res., 26(2): 127-141. ISSN 0305-0548.
), (
13
13. DYER ME & WOLSEY LA. 1990. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math., 26(2-3): 255-270. ISSN 0166-218X.
),
|
|
|
(
5
5. KEHA AB, KHOWALA K & FOWLER JW. 2009. Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1): 357-367. ISSN 0360-8352.
), (
30
30. ZHU Z & HEADY RB. 2000. Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Computers & Industrial Engineering, 38(2): 297-305. ISSN 0360-8352.
)
|
| with s
ij
|
(
31
31. ASCHEUER N, FISCHETTI M & GRÖTSCHEL M. 2001. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming , 90(3): 475-506.
), (
32
32. BALAS E. 1985. On the facial structure of scheduling polyhedra. In: Cottle RW. (Ed.), Mathematical Programming Essays in Honor of George B. Dantzig Part I, of Mathematical Programming Studies, 24: 179-218. Springer Berlin Heidelberg, ISBN 978-3-642-00918-1.
), (
33
33. BALAS E, SIMONETTI N & VAZACOPOULOS A. 2008. Job shop scheduling with setup times, deadlines and precedence constraints. Journal of Scheduling , 11: 253-262. ISSN 1094-6136.
),
|
|
|
(
34
34. BALLICU M, GIUA A & SEATZU C. 2002. Job-shop scheduling models with set-up times. In: Systems, Man and Cybernetics, 2002 IEEE International Conference on, volume 5, page 6.
), (
35
35. CHOI I-C & CHOI D-S. 2002. A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups. Comput. Ind. Eng., 42(1): 43-58. ISSN 0360-8352.
), (
36
36. EIJL VAN C. 1995. A polyhedral approach to the delivery man problem,. Technical report, Tech Report 95-19", Dep of Maths and Computer Science, Eindhoven Univ of Technology, the Netherlands.
),
|
|
|
(
37
37. EREN T & GUNER E. 2006. A bicriteria scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 179: 378-385.
), (
38
38. HERR O & GOEL A. 2016. Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints. European Journal of Operational Research, 248(1): 123-135.
), (
39
39. LARSEN J. 1999. Parallelization of the Vehicle Routing Problem with Time Windows. PhD thesis, DTU Technical University of Denmark.
),
|
|
|
(
40
40. MAFFIOLI F & SCIOMACHEN A. 1997. A mixed-integer model for solving ordering problems with side constraints. Annals of Operations Research, 69: 277-297.
), (
41
41. NADERI B, GHOMI SMTF, AMINNAYERI M & ZANDIEH M. 2011. Modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time. The International Journal of Advanced Manufacturing Technology, 53: 751-760. ISSN 0268-3768.
), (
42
42. NOGUEIRA TH, DE CARVALHO CRV, SANTOS GPA & DE CAMARGO LC. 2015. Mathematical model applied to single-track line scheduling problem in brazilian railways. 4OR, 13(4): 403-441.
),
|
|
|
(
11
11. QUEYRANNE M. 1993. Structure of a simple scheduling polyhedron. Mathematical Programming, 58: 263-285. ISSN 0025-5610.
), (
2
2. QUEYRANNE M, SCHULZ AS & UNIVERSITAT T. 1994. Polyhedral approaches to machine scheduling. Technical report, Berlin, Germany: Technical University of Berlin, Department of Mathematics.
), (
43
43. MERCADO RZR & BARD JF. 2003. The flow shop scheduling polyhedron with setup times. Journal of Combinatorial Optimization, 7: 291-318. ISSN 1382-6905.
),
|
|
|
(
44
44. ROCHA PL, RAVETTI MG, MATEUS GR & PARDALOS PM. 2008. Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Computers & Operations Research , 35(4): 1250-1264. ISSN 0305-0548.
), (
45
45. JACOB VV & ARROYO JEC. 2016. ILS Heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness. Journal of Applied Mathematics, vol. 2016, Article ID 9598041, 15 pages.
), (
30
30. ZHU Z & HEADY RB. 2000. Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Computers & Industrial Engineering, 38(2): 297-305. ISSN 0360-8352.
|
| Linear Ordering |
no parameters |
(
5
5. KEHA AB, KHOWALA K & FOWLER JW. 2009. Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1): 357-367. ISSN 0360-8352.
)
|
|
rj and no s
ij
|
(
5
5. KEHA AB, KHOWALA K & FOWLER JW. 2009. Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1): 357-367. ISSN 0360-8352.
), (
46
46. NEMHAUSER GL & SAVELSBERGH MWP. 1992. A cutting plane algorithm for the single machine scheduling problem with release times. Springer.
), (
19
19. SADYKOV R. 2006. Integer Programming-based Decomposition Approaches for Solving Machine Scheduling Problems. PhD thesis, Université Catholique de Louvain.
)
|
| Assignment and Positional Date |
no parameters |
(
47
47. DAUZÈRE-PÉRÈS S & MÖNCH L. 2013. Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective. Computers & Operations Research , 40(5): 1224-1233.
), (
5
5. KEHA AB, KHOWALA K & FOWLER JW. 2009. Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1): 357-367. ISSN 0360-8352.
), (
48
48. WAGNER HM. 1959. An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly, 6(2): 131-140. ISSN 1931-9193.
)
|
|
rj and no s
ij
|
(
49
49. DAUZÈRE-PÉRÈS S & SEVAUX M. 2002. Lagrangean relaxation for minimizing the weighted number of late jobs on parallel machines. In: Proceedings of 8th international workshop on project management and scheduling, PMS, 2002: 121-124.
), (
5
5. KEHA AB, KHOWALA K & FOWLER JW. 2009. Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1): 357-367. ISSN 0360-8352.
), (
50
50. SORÍC K. 2000. A cutting plane algorithm for a single machine scheduling problem. European Journal of Operational Research , 127: 383-393.
), (
6
6. UNLU Y & MASON SJ. 2010. Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Computers & Industrial Engineering, 58(4):785-800. ISSN 0360-8352.
)
|
| with s
ij
|
(
51
51. STAFFORD JR EF & TSENG FT. 2002. Two models for a family of flowshop sequencing problems. European Journal of Operational Research , 142: 282-293.
), (
52
52. LEE SM & ASLLANI AA. 2004. Job scheduling with dual criteria and sequencedependent setups: mathematical versus genetic programming. Omega, 32(2): 145-153. ISSN 0305-0483.
), (
44
44. ROCHA PL, RAVETTI MG, MATEUS GR & PARDALOS PM. 2008. Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Computers & Operations Research , 35(4): 1250-1264. ISSN 0305-0548.
), (
53
53. SHUFENG W & YIREN Z. 2002. Scheduling to minimize the maximum lateness with multiple product classes in batch processing. In: TENCON ’02. Proceedings. 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering, 3: 1595-1598.
)
|
| Others |
(
54
54. ABDEKHODAEE AH & WIRTH A. 2002. Scheduling parallel machines with a single server: some solvable cases and heuristics. Computers & Operations Research , 19(3): 295-315.
), (
55
55. İŞLER MC, TOKLU B & ÇELIK V. 2012. Scheduling in a two-machine flowshop for earliness/ tardiness under learning effect. The International Journal of Advanced Manufacturing Technology , 61(9-12): 1129-1137.
), (
56
56. PAN JC-H, CHEN J-S & CHENG H-L. 2001. A heuristic approach for single-machine scheduling with due dates and class setups. Computers & Operations Research , 28(11): 1111-1130. ISSN 0305-0548.
), (
57
57. SAKURABA CS, RONCONI DP & SOURD F. 2009. Scheduling in a twomachine flowshop for the minimization of the mean absolute deviation from a common due date. Computers & Operations Research , 36(1): 60-72. ISSN 0305-0548.
)
|
| Time-Indexed |
no parameters |
(
58
58. ANGLANI A, GRIECO A, GUERRIERO E & MUSMANNO R. 2005. Robust scheduling of parallel machines with sequence-dependent set-up costs. European Journal of Operational Research , 161(3): 704-720.
), (
59
59. CHEN H & LUH PB. 2003. An alternative framework to lagrangian relaxation approach for job shop scheduling. European Journal of Operational Research , 149(3): 499-512.
), (
60
60. CZERWINSKI CS & LUH PB. 1994. Scheduling products with bills of materials using an improved lagrangian relaxation technique. Robotics and Automation, IEEE Transactions on, 10(2): 99-111. ISSN 1042-296X.
),
|
|
|
(
61
61. GOLMOHAMMADI A, BANI-ASADI H, ZANJANI H & TIKANI H. 2016. A genetic algorithm for preemptive scheduling of a single machine. International Journal of Industrial Engineering Computations, 7(4): 607-614.
), (
62
62. HOITOMT DJ, LUH PB, MAX E & PATTIPATI KR. 1990. Scheduling jobs with simple precedence constraints on parallel machines. Control Systems Magazine, IEEE, 10(2): 34-40. ISSN 0272-1708.
), (
5
5. KEHA AB, KHOWALA K & FOWLER JW. 2009. Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1): 357-367. ISSN 0360-8352.
),
|
|
|
(
63
63. LUH PB & HOITOMT DJ. 1993. Scheduling of manufacturing systems using the lagrangian relaxation technique. Automatic Control, IEEE Transactions on, 38(7): 1066-1079. ISSN 0018-9286.
), (
64
64. PAN Y & SHI L. 2007. On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. Mathematical Programming , 110: 543-559. ISSN 0025-5610.
), (
21
21. SOURD F. 2009. New exact algorithms for one-machine earliness-tardiness scheduling. INFORMS Journal on Computing, 21(1): 167-175.
),
|
|
|
(
22
22. SOUSA JP & WOLSEY LA. 1992. A time indexed formulation of nonpreemptive single machine scheduling problems. Mathematical Programming, 54: 353-367.
), (
65
65. TANAKA S & ARAKI M. 2008. A branch-and-bound algorithm with lagrangian relaxation to minimize total tardiness on identical parallel machines. International Journal of Production Economics, 113(1): 446-458.
), (
23
23. TANAKA S, FUJIKUMA S & ARAKI M. 2009. An exact algorithm for singlemachine scheduling without machine idle time. Journal of Scheduling , 12: 575-593. ISSN 1094-6136.
), (
66
66. WANG J & LUH PB. 1997. Scheduling job shops with batch machines using the lagrangian relaxation technique. European journal of control, 3-4: 268-279.
)
|
|
rj and no s
ij
|
(
67
67. CRAUWELS HAJ, BEULLENS P & VAN OUDHEUSDEN D. 2006. Parallel machine scheduling by family batching with sequence-independent set-up times. International Journal of Operations Research, 3(2): 144-154.
), (
68
68. DETIENNE B, PINSON E & RIVREAU D. 2010. Lagrangian domain reductions for the single machine earliness tardiness problem with release dates. European Journal of Operational Research , 201: 45-54.
), (
69
69. JIN B & LUH PB. 1999. An effective optimization-based algorithm for job shop scheduling with fixed-size transfer lots. Journal of Manufacturing Systems, 18(4): 284-300.
),
|
|
|
(
5
5. KEHA AB, KHOWALA K & FOWLER JW. 2009. Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1): 357-367. ISSN 0360-8352.
), (
70
70. LIU C-Y & CHANG S-C. 2000. Scheduling flexible flow shops with sequence-dependent setup effects. Robotics and Automation, IEEE Transactions on , 16(4): 408-419. ISSN 1042-296X.
), (
2
2. QUEYRANNE M, SCHULZ AS & UNIVERSITAT T. 1994. Polyhedral approaches to machine scheduling. Technical report, Berlin, Germany: Technical University of Berlin, Department of Mathematics.
),
|
|
|
(
6
6. UNLU Y & MASON SJ. 2010. Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Computers & Industrial Engineering, 58(4):785-800. ISSN 0360-8352.
), (
71
71. VAN DEN AKKER JM, VAN HOESEL CPM & SAVELSBERGH MWP. 1999. A polyhedral approach to single-machine scheduling problems. Mathematical Programming , 85(3): 541-572.
)
|
| with s
ij
|
(
72
72. BUIL R, PIERA MA & LUH PB. 2012. Improvement of lagrangian relaxation convergence for production scheduling. Automation Science and Engineering, IEEE Transactions on, 9(1): 137-147. ISSN 1545-5955.
), (
73
73. HOITOMT DJ, LUH PB & PATTIPATI KR. 1993. A practical approach to job-shop scheduling problems. Robotics and Automation, IEEE Transactions on , 9(1): 1-13. ISSN 1042-296X.
), (
74
74. KESHAVARZ T, SAVELSBERGH M & SALMASI N. 2015. A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties. Applied Mathematical Modelling, 39(20): 6410-6424.
),
|
|
|
(
70
70. LIU C-Y & CHANG S-C. 2000. Scheduling flexible flow shops with sequence-dependent setup effects. Robotics and Automation, IEEE Transactions on , 16(4): 408-419. ISSN 1042-296X.
), (
63
63. LUH PB & HOITOMT DJ. 1993. Scheduling of manufacturing systems using the lagrangian relaxation technique. Automatic Control, IEEE Transactions on, 38(7): 1066-1079. ISSN 0018-9286.
), (
75
75. LUH PB, GOU L, ZHANG Y, NAGAHORA T, TSUJI M, YONEDA K, HASEGAWA T, KYOYA Y & KANO T. 1998. Job shop scheduling with group-dependent setups, finite buffers, and long time horizon. Annals of Operations Research , 76: 233-259. ISSN 0254-5330.
),
|
|
|
(
76
76. LUH PB, CHEN D & THAKUR LS. 1999. An effective approach for job-shop scheduling with uncertain processing requirements. Robotics and Automation, IEEE Transactions on , 15(2): 328-339. ISSN 1042-296X.
), (
77
77. LUH PB, ZHOU X & TOMASTIK RN. 2000. An effective method to reduce inventory in job shops. Robotics and Automation, IEEE Transactions on , 16(4): 420-424. ISSN 1042-296X.
), (
78
78. PAULA MR, MATEUS GR & RAVETTI MG. 2010. A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times. Computers & Operations Research , 37(5): 938-949. ISSN 0305-0548.
), (
79
79. SUN X, NOBLE J & KLEIN C. 1999. Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Transactions, 31: 113-124. ISSN 0740-817X.
)
|
| Arc-Time-Indexed |
with s
ij
|
(
80
80. ABELEDO H, FUKASAWA R, PESSOA A & UCHOA E. 2010. The time dependent traveling salesman problem: Polyhedra and branch-cut-and-price algorithm. In: Paola Festa (Ed.), Experimental Algorithms, volume 6049 of Lecture Notes in Computer Science, pages 202-213. Springer Berlin Heidelberg. ISBN 978-3-642-13192-9.
), (
81
81. ABELEDO H, FUKASAWA R, PESSOA A & UCHOA E. 2013. The time dependent traveling salesman problem: polyhedra and algorithm. Mathematical Programming Computation, 5: 27-55.
), (
82
82. BATTARRA M, PESSOA AA, SUBRAMANIAN A & UCHOA E. 2013. Exact algorithms for the traveling salesman problem with draft limits. Optimization Online Repositories.
),
|
|
|
(
83
83. BIGRAS L-P, GAMACHE M & SAVARD G. 2008. The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optimization, 5(4): 685-699.
), (
42
42. NOGUEIRA TH, DE CARVALHO CRV, SANTOS GPA & DE CAMARGO LC. 2015. Mathematical model applied to single-track line scheduling problem in brazilian railways. 4OR, 13(4): 403-441.
)
|
