The DOI matches its Crossref record.
Introduction to Sequencing and Scheduling
Abstract
(1977). Introduction to Sequencing and Scheduling. Journal of the Operational Research Society: Vol. 28, No. 2, pp. 352-353.
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
Cited by
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Neural-network-based fuzzy logic control and decision system
Lin, C.-T., & Lee, C. S. G. (1991) · IEEE Transactions on Computers · doi:10.1109/12.106218 · Cited by 1,480
A state-of-the-art survey of dispatching rules for manufacturing job shop operations
BLACKSTONE, J. H., PHILLIPS, D. T., & HOGG, G. L. (1982) · International Journal of Production Research · doi:10.1080/00207548208947745 · Cited by 1,013
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Hall, N. G., & Sriskandarajah, C. (1996) · Operations Research · doi:10.1287/opre.44.3.510 · Cited by 842
Chapter 9 Sequencing and scheduling: Algorithms and complexity
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80189-6 · Cited by 761
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
A comprehensive review and evaluation of permutation flowshop heuristics
Ruiz, R., & Maroto, C. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.04.017 · Cited by 579
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 546
Pilkington, A., & Meredith, J. (2009) · Journal of Operations Management · doi:10.1016/j.jom.2008.08.001 · Cited by 537
The job shop scheduling problem: Conventional and new solution techniques
Błażewicz, J., Domschke, W., & Pesch, E. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00362-2 · Cited by 536
Local search in combinatorial optimization
Crama, Y., Kolen, A. W. J., & Pesch, E. J. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0027029 · Cited by 361
Surgical case scheduling as a generalized job shop scheduling problem
Pham, D.-N., & Klinkert, A. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.03.059 · Cited by 357
Houssein, E. H., Gad, A. G., Wazery, Y. M., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100841 · Cited by 355
Flowshop-scheduling problems with makespan criterion: a review
Reza Hejazi *, S., & Saghafian, S. (2005) · International Journal of Production Research · doi:10.1080/0020754050056417 · Cited by 342
Minimizing the average deviation of job completion times about a common due date
Kanet, J. J. (1981) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800280411 · Cited by 326
Cheng, R., Gen, M., & Tsujimura, Y. (1999) · Computers & Industrial Engineering · doi:10.1016/s0360-8352(99)00022-4 · Cited by 323
Introducing global constraints in CHIP
Beldiceanu, N., & Contejean, E. (1994) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(94)90127-9 · Cited by 315
Ogbu, F. A., & Smith, D. K. (1990) · Computers & Operations Research · doi:10.1016/0305-0548(90)90001-n · Cited by 310
Extending chip in order to solve complex scheduling and placement problems
Aggoun, A., & Beldiceanu, N. (1993) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(93)90068-a · Cited by 304
A comparative study of dispatching rules in dynamic flowshops and jobshops
Rajendran, C., & Holthaus, O. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00023-x · Cited by 294
Sakawa, M., & Kubota, R. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00094-6 · Cited by 287
Dynamic job-shop scheduling using reinforcement learning agents
Aydin, M. E., & Öztemel, E. (2000) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(00)00087-7 · Cited by 274
Is production and operations management a discipline? A citation/co‐citation study
Pilkington, A., & Liston‐Heyes, C. (1999) · International Journal of Operations & Production Management · doi:10.1108/01443579910244188 · Cited by 188
Metadata
- Authors
- Clewett, A. J., & Baker, K. R.
- Venue
- Operational Research Quarterly (1970-1977)
- Publisher
- JSTOR
- Published
- 1977
- Volume
- 28
- Issue
- 2
- Pages
- 352
- ISSN
- 0030-3623 (ISSN-L)
- OpenAlex
- W2042312329
- Cited by
- 2,597
- References
- 0
- FWCI
- 174.54
- 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
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.