scientific article; zbMATH DE number 930117

zbMATH Open0853.68063MaRDI QIDQ4894072FDOQ4894072

Authors: Zhi-Long Chen, Xiao-ping Zhao 

Publication date: 2 January 1997

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

schedulingweighted completion times

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs
• A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• Two-Machine Open Shops with Renewable Resources
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
• Open shop unit-time scheduling problems with symmetric objective functions
• Open shop problem to minimize the total weighted completion time

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)