The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Scheduling jobs on parallel machines with sequence-dependent setup times
Open accessAbstract
Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the weighted tardinesses. In the first phase, as a pre-processing procedure, factors or statistics which characterize an instance are computed. The second phase consists of constructing a sequence by a dispatching rule which is controlled through parameters determined by the factors. In the third phase, as a post-processing procedure, a simulated annealing method is applied starting from a seed solution which is the result of the second phase. In the dispatching rule of the second phase there are two parameters of which the values are dependent on the particular problem instance at hand. Through extensive experiments rules are developed for determining the values of the two parameters which make the priority rule work effectively. The performance of the simulated annealing procedure in the third phase is evaluated for various values of the factors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Job Shop Scheduling by Simulated Annealing
van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992) · Operations Research · doi:10.1287/opre.40.1.113 · Cited by 1,123
Minimizing Total Tardiness on One Machine is NP-Hard
Du, J., & Leung, J. Y.-T. (1990) · Mathematics of Operations Research · doi:10.1287/moor.15.3.483 · Cited by 744
A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness
Lawler, E. L. (1977) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70742-8 · Cited by 610
Priority Rules for Job Shops with Weighted Tardiness Costs
Vepsalainen, A. P. J., & Morton, T. E. (1987) · Management Science · doi:10.1287/mnsc.33.8.1035 · Cited by 577
A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
Potts, C. N., & Wassenhove, L. N. V. (1985) · Operations Research · doi:10.1287/opre.33.2.363 · Cited by 278
A survey of algorithms for the single machine total weighted tardiness scheduling problem
Abdul-Razaq, T. S., Potts, C. N., & Wassenhove, L. N. V. (1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90103-j · Cited by 207
Simulated Annealing Without Rejected Moves
Greene, J. W., & Supowit, K. J. (1986) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1986.1270190 · Cited by 137
Metadata
- Authors
- Lee, Y. H., & Pinedo, M.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 1997-08
- Volume
- 100
- Issue
- 3
- Pages
- 464-474
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2034801210
- Cited by
- 273
- References
- 11
- FWCI
- 14.43
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Scheduling jobs on parallel machines with sequence-dependent setup times. https://app.cochat.ai/papers/10.1016/s0377-2217(95)00376-2
- The paper
- Lee, Y. H., & Pinedo, M. (1997). Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research. https://doi.org/10.1016/s0377-2217(95)00376-2
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.