Just-in-time scheduling problem with affine idleness cost-Reference-Cited by-同舟云学术

Just-in-time scheduling problem with affine idleness cost

Published:2024-03 Issue:3 Volume:313 Page:954-976
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Tan Zhen^ORCID,Fu Guanqi^ORCID

Funder

University of Nottingham Ningbo China

National Natural Science Foundation of China

Natural Science Foundation of Zhejiang Province

Publisher

Elsevier BV

Subject

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

Reference29 articles.

1. A genetic algorithm for scheduling open shops with sequence-dependent setup times;Abreu;Computers & Operations Research,2020

2. Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension;Alidaee;Omega,2021

3. Scheduling unit tasks to minimize the number of idle periods: A polynomial time algorithm for offline dynamic power management;Baptiste,2006

4. Single-machine scheduling with an external resource;Briskorn;European Journal of Operational Research,2021

5. Performance improvement of a genetic algorithm using a novel restart strategy with elitism principle;Das;International Journal of Hybrid Intelligent Systems,2019

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

1. Just-in-time scheduling of unrelated parallel machines with family setups and soft time window constraints;Journal of Industrial and Production Engineering;2024-06-13

2. Demand-Driven Supply Chain Harmonizing Digitalization, Resilience, and Sustainability : Exploring the Synergy through a Bibliometric Literature Review;2024 IEEE 15th International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA);2024-05-02