Some new efficient methods to solve the n/1/ri/ϵTi scheduling problem-Reference-Cited by-同舟云学术

Some new efficient methods to solve the n/1/ri/ϵTi scheduling problem

Published:1992-05 Issue:3 Volume:58 Page:404-413
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Chu C.,Portmann M.-C.

Publisher

Elsevier BV

Subject

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

Reference19 articles.

1. Introduction to Sequencing and Scheduling;Baker,1974

2. A dynamic priority rule for scheduling against due-dates;Baker;Journal of Operations Management,1982

3. Minimisation de la somme des retards pour les problèmes d'ordonnancement à une machine;Chu,1989

4. Single machine scheduling problems with release dates;Chu;EURO WG-PMS,1990

5. Theory of Scheduling;Conway,1967

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

1. Three classes of Earliness-Tardiness (E/T) scheduling problems;Fuel Communications;2022-03

2. Optimal Online Electric Vehicle Charging Scheduling in Unbalanced Three-Phase Power System;Computational Science and Its Applications – ICCSA 2020;2020

3. Extensions of the Basic Model;Principles of Sequencing and Scheduling;2018-10-19

4. Effective heuristics for solving dynamic variant of single processor total tardiness problems;Journal of Project Management;2018

5. Stochastic Scheduling for a Network of Flexible Job Shops;International Series in Operations Research & Management Science;2016