The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Solving Parallel Machine Scheduling Problems by Column Generation
Abstract
We consider a class of problems of scheduling n jobs on m identical, uniform, or unrelated parallel machines with an objective of minimizing an additive criterion. We propose a decomposition approach for solving these problems exactly. The decomposition approach first formulates these problems as an integer program, and then reformulates the integer program, using Dantzig-Wolfe decomposition, as a set partitioning problem. Based on this set partitioning formulation, branch-and-bound exact solution algorithms can be designed for these problems. In such a branch-and-bound tree, each node is the linear relaxation problem of a set partitioning problem. This linear relaxation problem is solved by a column generation approach where each column represents a schedule on one machine and is generated by solving a single machine subproblem. Branching is conducted on variables in the original integer programming formulation instead of variables in the set partitioning formulation such that single machine subproblems are more tractable. We apply this decomposition approach to two particular problems: the total weighted completion time problem and the weighted number of tardy jobs problem. The computational results indicate that the decomposition approach is promising and capable of solving large problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
Cited by
Cross dock scheduling: Classification, literature review and research agenda
Boysen, N., & Fliedner, M. (2010) · Omega · doi:10.1016/j.omega.2009.10.008 · Cited by 363
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
“Job scheduling Automated manufacturing systems van de Klundert (1996) Common due date van den Akker, Hoogeveen and van de Velde (1997) Parallel assembly lines Clements, Crawford, Joslin, Nemhauser, Puttlits and Savelsbergh (1997) Parallel machines van den Akker, Hoogeveen and van de Velde (1999) Chen and Powell (1999a…”
Background
Metadata
- Authors
- Chen, Z.-L., & Powell, W. B.
- Venue
- INFORMS Journal on Computing
- Published
- 1999-02
- Volume
- 11
- Issue
- 1
- Pages
- 78-94
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2120350145
- Cited by
- 203
- References
- 1
- FWCI
- 15.96
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Solving Parallel Machine Scheduling Problems by Column Generation. https://app.cochat.ai/papers/10.1287/ijoc.11.1.78
- The paper
- Chen, Z.-L., & Powell, W. B. (1999). Solving Parallel Machine Scheduling Problems by Column Generation. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.11.1.78
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.