Name
Title | ||
|---|---|---|
An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines. |
Abstract | ||
|---|---|---|
This paper compares the efficacy of a newly developed network-based mixed-integer programming (MIP) formulation with three existing formulations for the sequence dependent setup scheduling problem with earliness/tardiness penalties. This research shows that the new model is more efficient in terms of computation time for larger multi-machine problems than the existing formulations of these problems. The mixed-integer nature of the formulation allows companies to solve this class of problems with any one of many commonly available integer programming software packages. The presented MIP formulation provides a unique and useful method of conceptualizing and modeling a practical, yet difficult, problem within industry. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.mcm.2012.06.029 | Mathematical and Computer Modelling |
Keywords | Field | DocType |
Sequence-dependent setups,Scheduling,Mixed integer programming,Earliness,Tardiness | Mathematical optimization,Job shop scheduling,Tardiness,Sequence-dependent setup,Scheduling (computing),Integer programming,Software,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
57 | 3 | 0895-7177 |
Citations | PageRank | References |
3 | 0.50 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bradley E. Anderson | 1 | 3 | 0.50 |
| James D. Blocher | 2 | 13 | 2.30 |
| Kurt M. Bretthauer | 3 | 300 | 23.24 |
| M. A. Venkataramanan | 4 | 245 | 20.52 |