Minimizing the earliness–tardiness costs on a single machine-Reference-Cited by-同舟云学术

Minimizing the earliness–tardiness costs on a single machine

Published:2006-11 Issue:11 Volume:33 Page:3219-3230
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Bauman Jakub,Józefowska Joanna

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference10 articles.

1. Theory of scheduling;Conway,1967

2. One-processor scheduling with symmetric earliness and tardiness penalties;Garey;Mathematics of Operations Research,1988

3. Yano C, Kim Y. Algorithms for single machine scheduling problems minimizing tardiness and earliness. Technical report #86-40, Department of Industrial Engineering, University of Michigan, Ann Arbor, USA, 1986.

4. Dynamic programming state-space relaxation for single-machine scheduling;Abdul-Razaq;Journal of the Operational Research Society,1988

5. Szwarc W. Minimizing absolute lateness in single machine scheduling with different due dates. Working Paper, University of Wisconsin, Milwaukee, USA, 1988.

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

1. Minimizing the total weighted earliness and tardiness for a sequence of operations in job shops;RAIRO - Operations Research;2022-07

2. Just-in-time single-batch-processing machine scheduling;Computers & Operations Research;2022-04

3. Just-in-Time Precast Production Scheduling Using Dominance Rule-Based Genetic Algorithm;IEEE Transactions on Neural Networks and Learning Systems;2022

4. Material flow optimisation of production planning and scheduling problem in flexible manufacturing system by real coded genetic algorithm (RCGA);Flexible Services and Manufacturing Journal;2018-03-17

5. COLLABORATIVE PARADIGM FOR SINGLE-MACHINE SCHEDULING UNDER JUST-IN-TIME PRINCIPLES: TOTAL HOLDING-TARDINESS COST PROBLEM;MANAG PROD ENG REV;2018