A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness-Reference-Cited by-同舟云学术

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

Published:1986-08 Issue:3 Volume:33 Page:551-557
ISSN:0028-1441
Container-title:Naval Research Logistics Quarterly
language:en
Short-container-title:Naval Research Logistics

Author:

Chand Suresh,Schneeberger Hans

Publisher

Wiley

Subject

General Engineering

Reference8 articles.

1. Scheduling to minimize the weighted sum of completion times with secondary criteria

2. and , “Single Machine Scheduling to Minimize Weighted Completion Time with Maximum Allowable Tradiness,” Working Paper, Krannert Graduate School of Management, Purdue University, 1984.

3. A note on a scheduling problem with dual criteria

4. A note on the extension of a result on scheduling with secondary criteria

5. Complexity of Machine Scheduling Problems

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

1. Minimizing Tardiness Penalty Costs in Job Shop Scheduling under Maximum Allowable Tardiness;Processes;2020-11-02

2. An Improved Whale Optimization Algorithm for Job-Shop Scheduling Based on Quantum Computing;International Journal of Simulation Modelling;2019-09-15

3. Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness;Cogent Mathematics;2015-03-03

4. Bi-Objective Scheduling on Parallel Machines in Fuzzy Environment;Advances in Intelligent Systems and Computing;2014

5. Counting and enumeration complexity with application to multicriteria scheduling;Annals of Operations Research;2007-04-21