scientific article
From MaRDI portal
Publication:3328238
zbMATH Open0539.90043MaRDI QIDQ3328238
Author name not available (Why is that?)
Publication date: 1982
Title of this publication is not available (Why is that?)
computational experiencedeterministic schedulingindependent tasksbranch and bound solution algorithmmean weighted completion timenon-equal processing times
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (7)
Title not available (Why is that?) ⋮ Scheduling about a common due date with earliness and tardiness penalties ⋮ Scheduling start time dependent jobs to minimize the total weighted completion time ⋮ Quality of move-optimal schedules for minimizing total weighted completion time ⋮ Preemptive scheduling with availability constraints to minimize total weighted completion times ⋮ Title not available (Why is that?) ⋮ On scheduling with ready-times, due-dates and vacations
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 Q3328238)
