## 3 Task Scheduling with Mixed-Integer Programming
### Task Scheduling with the Kinematic Constraints
[CrossRef]
* (20) [PERSON]; [PERSON] Decision rule bounds for two-stage stochastic bilevel programs. _SIAM J. Optim._**2018**, _28_, 198-222. [CrossRef]
* (21) [PERSON]; [PERSON] _Computational Advances in Solving Mixed Integer Linear Programming Problems_; AIDAC: Rome, Italy, 2011. * (22) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Optimal cyclic multi-hoist scheduling: A mixed integer programming approach. _Oper. Res._**2004**, _52_, 965-976. [CrossRef]
* (23) [PERSON] Batch versus cyclic scheduling of flexible flow shops by mixed-integer programming. _Int. J. Prod. Res._**2012**, _50_, 5017-5034. [CrossRef]
* (24) [PERSON]; [PERSON]; [PERSON]; [PERSON] An improved mixed integer programming approach for multi-hoist cyclic scheduling problem. _IEEE Trans. Autom. Sci. Eng._**2013**, _11_, 302-309. [CrossRef]
* (25) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Task Planning with Mixed-Integer Programming for Multiple Cooking Task Using dual-arm Robot. In Proceedings of the 2020 17 th International Conference on Ubiquitous Robots (UR), Kyoto, Japan, 22-26 June 2020; pp. 29-35. * (26) [PERSON]; [PERSON] Ant colony optimization combined with taboo search for the job shop scheduling problem. _Comput. Oper. Res._**2008**, _35_, 1030-1046. [CrossRef]
* (27) [PERSON]; [PERSON]; [PERSON] A hybrid artificial bee colony algorithm for the job shop scheduling problem. _Int. J. Prod. Econ._**2013**, _141_, 167-178. [CrossRef]
* (28) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. _Int. J. Adv. Manuf. Technol._**2012**, _60_, 303-315. [CrossRef]
* (29) [PERSON]; [PERSON] Conventional genetic algorithm for job shop problems. _ICGA_**1991**, _91_, 474-479. * (30) [PERSON] [PERSON]; [PERSON]; [PERSON] A genetic algorithm for the job shop problem. _Comput. Oper. Res._**1995**, _22_, 15-24. [CrossRef]
* (31) [PERSON]; [PERSON] A hybrid particle swarm optimization for job shop scheduling problem. _Comput. Ind. Eng._**2006**, _51_, 791-808. [CrossRef]
* (32) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] An efficient job-shop scheduling algorithm based on particle swarm optimization. _Expert Syst. Appl._**2010**, _37_, 2629-2636. [CrossRef]
* (33) [PERSON]; [PERSON]; [PERSON] Flexible job-shop scheduling with parallel variable neighborhood search algorithm. _Expert Syst. Appl._**2010**, _37_, 678-687. [CrossRef]
* (34) [PERSON]; [PERSON]; [PERSON] Multi-objective scheduling of dynamic job shop using variable neighborhood search. _Expert Syst. Appl._**2010**, _37_, 282-287. [CrossRef]
* (35) [PERSON]; [PERSON]; [PERSON] The shifting bottleneck procedure for job shop scheduling. _Manag. Sci._**1988**, _34_, 391-401. [CrossRef]
* (36) [PERSON] Solution-guided multi-point constructive search for job shop scheduling. _J. Artif. Intell. Res._**2007**, _29_, 49-77. [CrossRef]
* (37) [PERSON]; [PERSON]; [PERSON] Combining constraint programming and local search for job-shop scheduling. _INFORMS J. Comput._**2011**, _23_, 1-14. [CrossRef]
* (38) [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] Solving the job-shop scheduling problem optimally by dynamic programming. _Comput. Oper. Res._**2012**, _39_, 2968-2977. [CrossRef]
* (39) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. _Comput. Ind. Eng._**2020**, _142_, 106347. [CrossRef]
* (40) [PERSON]; [PERSON] Mixed integer programming models for job shop scheduling: A computational analysis. _Comput. Oper. Res._**2016**, _73_, 165-173. [CrossRef]
* (41) [PERSON] [PERSON]; [PERSON] Mixed binary integer programming formulations for the reentrant job shop scheduling problem. _Comput. Oper. Res._**2005**, _32_, 1197-1212. [CrossRef]
* (42) [PERSON] [PERSON] A goal programming network for mixed integer linear programming: A case study for the job-shop scheduling problem. _Int. J. Neural Syst._**1991**, \(2\), 201-209.