The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A new dominance rule to minimize total weighted tardiness with unequal release dates
Open accessOverview
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
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,786
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-48056-5_8 · Cited by 2,322
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 617
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
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1992) · Management Science · doi:10.1287/mnsc.38.10.1495 · Cited by 552
Machine Scheduling Problems: Classification, complexity and computations
Kan, R. (1976) · Medical Entomology and Zoology · Cited by 478
Heuristic scheduling systems with applications to production systems and project management
(1995) · European Journal of Operational Research · doi:10.1016/0377-2217(95)90067-5 · Cited by 358
One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
Emmons, H. (1969) · Operations Research · doi:10.1287/opre.17.4.701 · Cited by 348
Machine scheduling problems: Classification, complexity and computations
Rand, G. K. (1977) · European Journal of Operational Research · doi:10.1016/0377-2217(77)90029-7 · Cited by 342
Minimizing Total Costs in One-Machine Scheduling
Kan, A. H. G. R., Lageweg, B. J., & Lenstra, J. K. (1975) · Operations Research · doi:10.1287/opre.23.5.908 · Cited by 205
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
Crauwels, H., Potts, C. N., & Wassenhove, L. N. V. (1998) · INFORMS journal on computing · doi:10.1287/ijoc.10.3.341 · Cited by 171
Hariri, A. M. A., & Potts, C. N. (1983) · Discrete Applied Mathematics · doi:10.1016/0166-218x(83)90019-7 · Cited by 136
A branch-and-bound algorithm to minimize total tardiness with different release dates
Chu, C. (1992) · Naval Research Logistics (NRL) · doi:10.1002/1520-6750(199203)39:2 · Cited by 123
Intelligent Scheduling Systems
(1995) · Springer eBooks · doi:10.1007/978-1-4615-2263-8 · Cited by 96
Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
Potts, C. N., & Wassenhove, L. N. V. (1988) · Management Science · doi:10.1287/mnsc.34.7.843 · Cited by 96
Scheduling of a single machine to minimize total weighted completion time subject to release dates
Bianco, L., & Ricciardelli, S. (1982) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800290114 · Cited by 85
A branch-and-bound algorithm to minimize total flow time with unequal release dates
Chu, C. (1992) · Naval Research Logistics (NRL) · doi:10.1002/1520-6750(199210)39:6 · Cited by 82
Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
Dessouky, M. I., & Deogun, J. S. (1981) · SIAM Journal on Computing · doi:10.1137/0210014 · Cited by 80
Technical Note—A Note on the Weighted Tardiness Problem
Rachamadugu, R. (1987) · Operations Research · doi:10.1287/opre.35.3.450 · Cited by 64
Problem and Heuristic Space Search Strategies for Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1995) · INFORMS journal on computing · doi:10.1287/ijoc.7.4.453 · Cited by 58
A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
Erschler, J., Fontan, G., Mercé, C., et al. (1983) · Operations Research · doi:10.1287/opre.31.1.114 · Cited by 56
Some new efficient methods to solve the n/1/ri/ϵTi scheduling problem
Chu, C., & Portmann, M. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90071-g · Cited by 40
A new lower bounding scheme for the total weighted tardiness problem
Aktürk, M. S., & Yildirim, M. B. (1998) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00073-7 · Cited by 33
Weighted Tardiness Single Machine Scheduling with Proportional Weights
Szwarc, W., & Liu, J. J. (1993) · Management Science · doi:10.1287/mnsc.39.5.626 · Cited by 28
A DECISION THEORY APPROACH TO PRIORITY DISPATCHING FOR JOB SHOP SCHEDULING
Kanet, J. J., & Zhou, Z. (1993) · Production and Operations Management · doi:10.1111/j.1937-5956.1993.tb00035.x · Cited by 23
Tactically delayed versus non-delay scheduling: An experimental investigation
Kanet, J. J. (1986) · European Journal of Operational Research · doi:10.1016/0377-2217(86)90015-9 · Cited by 14
Guided Forward Search in Tardiness Scheduling of Large One Machine Problems
Morton, T. E., & Ramnath, P. (1995) · Springer eBooks · doi:10.1007/978-1-4615-2263-8_4 · Cited by 12
Flagged first, then by citations
Cited by
Sorted by citations
Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation
Cho, D.-H., Kim, J.-H., Choi, H.-L., & Ahn, J. (2018) · Journal of Aerospace Information Systems · doi:10.2514/1.i010620 · Cited by 98
Metadata
- Authors
- Akturk, M. S., & Ozdemir, D.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2001-12
- Volume
- 135
- Issue
- 2
- Pages
- 394-412
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2020401129
- Cited by
- 54
- References
- 27
- Citations by year
- 2023: 1 · 2021: 2 · 2020: 2 · 2019: 1 · 2018: 2 · 2016: 1 · 2015: 5 · 2014: 1 · 2013: 2 · 2012: 2
- FWCI
- 14.62
- Type
- journal article
- Language
- en
- Open access
- green
- hdl.handle.net
- Locations
- European Journal of Operational Research (publishedVersion)
- Bilkent University Institutional Repository (Bilkent University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Social Sciences › Decision Sciences › Management Science and Operations Research › Resource-Constrained Project Scheduling
- Social Sciences › Decision Sciences › Management Science and Operations Research › Healthcare Operations and Scheduling Optimization
- Keywords
- total weighted tardiness, single machine scheduling, dominance rules, local optimality, local search, heuristic scheduling
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
