Single machine scheduling to minimize weighted earliness subject to no tardy jobs-Reference-Cited by-同舟云学术

Single machine scheduling to minimize weighted earliness subject to no tardy jobs

Published:1988-03 Issue:2 Volume:34 Page:221-230
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Chand Suresh,Schneeberger Hans

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference10 articles.

1. Introduction to Sequencing and Scheduling;Baker,1974

2. Scheduling to minimize the weighted sum of completion times with secondary criteria;Burns;Naval Research Logistics Quarterly,1976

3. A note on the single machine scheduling problem with minimum weighted completion time and the maximum allowable tardiness;Chand;Naval Research Logistics Quarterly,1986

4. Note on a scheduling problem with dual criteria;Emmons;Naval Research Logistics Quarterly,1975

5. A note on the extension of a result on scheduling with secondary criteria;Heck;Naval Research Logistics Quarterly,1972

Cited by 68 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A no-tardiness job shop scheduling problem with overtime consideration and the solution approaches;Computers & Industrial Engineering;2023-04

2. A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems;European Journal of Operational Research;2023-03

3. Dynamic Programming algorithms and their applications in machine scheduling: A review;Expert Systems with Applications;2022-03

4. Finding efficient make-to-order production and batch delivery schedules;European Journal of Operational Research;2022-02

5. Integrated Production and Outbound Distribution Scheduling: Offline Problems;International Series in Operations Research & Management Science;2021-10-20