Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach

By Zhiwei Zhu, R. Heady. 2000

114 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering, Management Information Systems

View Paper: https://www.semanticscholar.org/paper/19443065af44116cb2569d9b626d7a7d1e7f98ec

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

1. Chi To Ng
2. T. C. Edwin Cheng
3. Ali Allahverdi
4. Mikhail Y. Kovalyov
5. Dong-Ho Lee
6. Rubén Ruiz
7. Morteza Mousakhani
8. Eva Vallada

In Management Information Systems

1. Chi To Ng
2. Dong-Ho Lee
3. Ali Allahverdi

Citations in the corpus

• A survey of scheduling problems with setup times or costs (2008, background): “Zhu and Heady (2000) addressed the R=ST sd = P w j E j þ P w j T j problem.”
• A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: minimizing total tardiness (2013, background): “Also, Zhu and Heady [28] propose a mixed integer programming model for the problem of minimizing the sum of earliness and tardiness penalties.”
• Hierarchical production planning and scheduling in a multi-product, batch process environment (2007, unknown): “More recently, Zhu and Heady (2000) proposed a mixed-integer programming formulation for minimizing the job earliness and tardiness scheduling problem for a non-uniform parallel machine and set-up considerations.”