Minimizing total tardiness in permutation flowshops-Reference-Cited by-同舟云学术

Minimizing total tardiness in permutation flowshops

Published:1995-09 Issue:3 Volume:85 Page:541-555
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Kim Yeong-Dae

Publisher

Elsevier BV

Subject

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

Reference24 articles.

1. Introduction to Sequencing and Scheduling;Baker,1974

2. A new bound for machine scheduling;Bestwick;Operational Research Quarterly,1976

3. Minimizing total tardiness on one machine in NP-hard;Du;Mathematics of Operations Research,1990

4. The lessons of flowshop scheduling research;Dudek;Operations Research,1992

5. Sequencing and Scheduling: An introduction to the Mathematics of the Job-Shop;French,1982

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

1. Minimizing Total Tardiness in a Two-Machine Flowshop Scheduling Problem with Availability Constraints;Intelligent Automation & Soft Computing;2023

2. A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem;Expert Systems with Applications;2020-11

3. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs;Computers & Operations Research;2020-02

4. A branch-and-bound approach to schedule a no-wait flow shop to minimize the CVaR of the residual work content;Computers & Industrial Engineering;2019-03

5. Trade-off balancing in scheduling for flow shop production and perioperative processes;European Journal of Operational Research;2019-03