A batching scheduling algorithm for maximizing total weighed number of jobs completed in due data window

MaRDI QIDQ3538467zbMATH OpenFDO

Authors Zhiguang Zhang, Zhihui Sun, Lingling Zhang

Publication date 24 November 2008

zbMATH Keywords

schedulingbatching machinedue data windownumber of completed jobs

Mathematics Subject Classification ID

Dynamic programming (90C39) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
• scientific article; zbMATH DE number 866105
• Due window scheduling for parallel machines
• Scheduling a batching machine

This page was built for publication: A batching scheduling algorithm for maximizing total weighed number of jobs completed in due data window

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