Lot scheduling on a single machine to minimize the (weighted) number of tardy orders

DOI10.1016/J.IPL.2020.106009zbMATH Open1466.90035OpenAlexW3045331303MaRDI QIDQ2203602FDOQ2203602

Authors: Baruch Mor, Gur Mosheiov, Dana Shapira 

Publication date: 7 October 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2020.106009

Recommendations

• A note on lot scheduling on a single machine to minimize maximum weighted tardiness
• Single machine scheduling to minimize total weighted tardiness
• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• scientific article; zbMATH DE number 866105
• Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times
• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
• Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Stochastic single machine scheduling to minimize the weighted number of tardy jobs

zbMATH Keywords

dynamic programmingschedulingsingle machinelot schedulingnumber of tardy orders

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Reducibility among Combinatorial Problems
• Title not available (Why is that?)
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Lot scheduling on a single machine
• Single machine lot scheduling to minimize the total weighted (discounted) completion time

Cited In (6)

• Single machine rescheduling for new orders with maximum lateness minimization
• A note on lot scheduling on a single machine to minimize maximum weighted tardiness
• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
• A note on the single machine CON and CONW problems with lot scheduling
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine

This page was built for publication: Lot scheduling on a single machine to minimize the (weighted) number of tardy orders

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