An Innovative Formulation Tightening Approach for Job-Shop Scheduling

Yan, Bing; Bragin, Mikhail A.; Luh, Peter B.

doi:10.1109/tase.2021.3088047

An Innovative Formulation Tightening Approach for Job-Shop Scheduling

Journal Article · 01 July 2022 · IEEE Transactions on Automation Science and Engineering

DOI:https://doi.org/10.1109/tase.2021.3088047· OSTI ID:1980460

^[1]; ^[2]; ^[2]

Department of Electrical and Microelectronic Engineering, Rochester Institute of Technology, Rochester, NY, USA
Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT, USA

Not provided.

Research Organization:: Univ. of California, Los Angeles, CA (United States)

Sponsoring Organization:: USDOE Office of Energy Efficiency and Renewable Energy (EERE)

DOE Contract Number:: EE0007613

OSTI ID:: 1980460

Journal Information:: IEEE Transactions on Automation Science and Engineering, Vol. 19, Issue 3; ISSN 1545-5955

Publisher:: IEEE

Country of Publication:: United States

Language:: English

References (23)

Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness Nishi, Tatsushi; Hiranaka, Yuichiro; Inuiguchi, Masahiro Computers & Operations Research, Vol. 37, Issue 1 https://doi.org/10.1016/j.cor.2009.04.008	journal	January 2010
A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process Mao, Kun; Pan, Quan-ke; Pang, Xinfu European Journal of Operational Research, Vol. 236, Issue 1 https://doi.org/10.1016/j.ejor.2013.11.010	journal	July 2014
A hybrid differential evolution algorithm with estimation of distribution algorithm for reentrant hybrid flow shop scheduling problem Zhou, Bing-hai; Hu, Li-man; Zhong, Zhen-yi Neural Computing and Applications, Vol. 30, Issue 1 https://doi.org/10.1007/s00521-016-2692-y	journal	November 2016
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups Ríos-Mercado, Roger Z.; Bard, Jonathan F. Computers & Operations Research, Vol. 25, Issue 5 https://doi.org/10.1016/S0305-0548(97)00079-8	journal	May 1998
Mixed binary integer programming formulations for the reentrant job shop scheduling problem Pan, Jason Chao-Hsien; Chen, Jen-Shiang Computers & Operations Research, Vol. 32, Issue 5 https://doi.org/10.1016/j.cor.2003.10.004	journal	May 2005
Lot sizing and job shop scheduling with compressible process times: A cut and branch approach Karimi-Nasab, M.; Modarres, M. Computers & Industrial Engineering, Vol. 85 https://doi.org/10.1016/j.cie.2015.03.020	journal	July 2015
Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times Özgüven, Cemal; Yavuz, Yasemin; Özbakır, Lale Applied Mathematical Modelling, Vol. 36, Issue 2 https://doi.org/10.1016/j.apm.2011.07.037	journal	February 2012
Multi-level lot sizing and job shop scheduling with compressible process times: A cutting plane approach Karimi-Nasab, M.; Seyedhoseini, S. M. European Journal of Operational Research, Vol. 231, Issue 3 https://doi.org/10.1016/j.ejor.2013.06.021	journal	December 2013
Global optimization using special ordered sets Beale, E. M. L.; Forrest, J. J. H. Mathematical Programming, Vol. 10, Issue 1 https://doi.org/10.1007/BF01580653	journal	December 1976
A Systematical Approach to Tighten Unit Commitment Formulations Yan, Bing; Luh, Peter B.; Litvinov, Eugene 2018 IEEE Power & Energy Society General Meeting (PESGM) https://doi.org/10.1109/PESGM.2018.8585784	conference	August 2018
Tightening simple mixed-integer sets with guaranteed bounds Bienstock, Daniel; McClosky, Benjamin Mathematical Programming, Vol. 133, Issue 1-2 https://doi.org/10.1007/s10107-010-0435-x	journal	December 2010
Novel Formulation and Resolution of Job-Shop Scheduling Problems Yan, Bing; Bragin, Mikhail A.; Luh, Peter B. IEEE Robotics and Automation Letters, Vol. 3, Issue 4 https://doi.org/10.1109/LRA.2018.2850056	journal	October 2018
Fourier-Motzkin elimination and its dual Dantzig, George B.; Curtis Eaves, B. Journal of Combinatorial Theory, Series A, Vol. 14, Issue 3 https://doi.org/10.1016/0097-3165(73)90004-6	journal	May 1973
A Systematic Formulation Tightening Approach for Unit Commitment Problems Yan, Bing; Luh, Peter B.; Zheng, Tongxin IEEE Transactions on Power Systems, Vol. 35, Issue 1 https://doi.org/10.1109/TPWRS.2019.2935003	journal	January 2020
Tightened Formulation and Resolution of Energy-Efficient Job-Shop Scheduling Yan, Bing; Bragin, Mikhail A.; Luh, Peter B. 2020 IEEE 16th International Conference on Automation Science and Engineering (CASE) https://doi.org/10.1109/CASE48305.2020.9217035	conference	August 2020
A practical approach to job-shop scheduling problems Hoitomt, D. J.; Luh, P. B.; Pattipati, K. R. IEEE Transactions on Robotics and Automation, Vol. 9, Issue 1 https://doi.org/10.1109/70.210791	journal	January 1993
An Improved Model for Parallel Machine Scheduling Under Time-of-Use Electricity Price Cheng, Junheng; Chu, Feng; Zhou, Mengchu IEEE Transactions on Automation Science and Engineering, Vol. 15, Issue 2 https://doi.org/10.1109/TASE.2016.2631491	journal	April 2018
Mathematical Modeling and Optimization of Energy-Conscious Flexible Job Shop Scheduling Problem With Worker Flexibility Meng, Leilei; Zhang, Chaoyong; Zhang, Biao IEEE Access, Vol. 7 https://doi.org/10.1109/ACCESS.2019.2916468	journal	January 2019
Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules Zhang, Sicheng; Wang, Shouyang IEEE Transactions on Engineering Management, Vol. 65, Issue 3 https://doi.org/10.1109/TEM.2017.2785774	journal	August 2018
Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem Meng, Leilei; Zhang, Chaoyong; Ren, Yaping Computers & Industrial Engineering, Vol. 142 https://doi.org/10.1016/j.cie.2020.106347	journal	April 2020
A mixed-integer linear programming model for integrated production and preventive maintenance scheduling in the capital goods industry Chansombat, Sirikarn; Pongcharoen, Pupong; Hicks, Christian International Journal of Production Research, Vol. 57, Issue 1 https://doi.org/10.1080/00207543.2018.1459923	journal	April 2018
On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems Sherali, Hanif D.; Driscoll, Patrick J. Operations Research, Vol. 50, Issue 4 https://doi.org/10.1287/opre.50.4.656.2865	journal	August 2002
Litho Machine Scheduling With Convex Hull Analyses Yan, Bing; Chen, Hsin Yuan; Luh, Peter B. IEEE Transactions on Automation Science and Engineering, Vol. 10, Issue 4 https://doi.org/10.1109/TASE.2013.2277812	journal	October 2013

Similar Records

A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem.

Conference · 2007 · OSTI ID:1146052

Watson, Jean-Paul; Beck, J. Christopher

A Multi-Objective Evolutionary Algorithm Approach for Optimizing Part Quality Aware Assembly Job Shop Scheduling Problems

Conference · 2021 · OSTI ID:1763897

Prince, Michael; DeHaan, Kristiian; Tauritz, Daniel

Deconstructing Nowicki and Smutnickis i-TSAB tabu search algorithm for the job-shop scheduling problem.

Journal Article · 2005 · Proposed for publication in Computers and Operations Research. · OSTI ID:971831

Whitley, L Darrell; Watson, Jean-Paul; Howe, Adele E

Related Subjects

Automation & Control Systems

An Innovative Formulation Tightening Approach for Job-Shop Scheduling

Citation Formats

References (23)

Similar Records

Related Subjects