An efficient job scheduling algorithm for mixed turnaround and deadline applications

DOI10.1016/0020-0255(78)90039-7zbMath0436.68028OpenAlexW2045328345MaRDI QIDQ1140986

K. Sundar Das, Toby J. Teorey

Publication date: 1978

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/2027.42/22493

zbMATH Keywords

job scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

An efficient job scheduling algorithm for mixed turnaround and deadline applications

Cites Work

• Unnamed Item
• An efficient job scheduling algorithm for mixed turnaround and deadline applications
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

This page was built for publication: An efficient job scheduling algorithm for mixed turnaround and deadline applications