scientific article; zbMATH DE number 930117

MaRDI QIDQ4894072zbMATH OpenFDO

Authors Zhi-Long Chen, Xiao-ping Zhao

Publication date 2 January 1997

zbMATH Keywords

schedulingweighted completion times

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1092175
• Minimizing the weighted number of late jobs in UET open shops
• Two-machine shop scheduling with zero and unit processing times
• Scheduling unit time open shops to minimize the weighted number of late jobs

Cited in

(12)

• A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
• Two-machine shop scheduling with zero and unit processing times
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• Two machine open shop scheduling problems with bi-criteria
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs
• Open shop problem to minimize the total weighted completion time
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
• Two-Machine Open Shops with Renewable Resources
• scientific article; zbMATH DE number 1092175 (Why is no real title available?)
• Minimizing the weighted number of late jobs in UET open shops
• scientific article; zbMATH DE number 5260089 (Why is no real title available?)
• Open shop unit-time scheduling problems with symmetric objective functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894072)