Journal of Industrial and Management Optimization · 2013 · 56 citations · 101 references
ManagementComputer ScienceOperations ManagementLean ManufacturingProduction PlanningSchedulingDue-date SchedulingJob SchedulingJob SequencingMachine SchedulingScheduling TheoryTardiness MinimizationDue Date ControlExpected Time To CompletionSingle-machine Due-date SchedulingSingle-machine SchedulingSingle-machine Tardiness SchedulingTotal Weighted TardinessWeighted Tardiness MinimizationWeighted Tardiness Scheduling
This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time $p_j$ and due date $d_j$. The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job $j$ is $C_j>d_j$ and on-time otherwise. This paper assesses works done to minimize the weighted number of tardy jobs by providing an extensive review of authors, methods and techniques used. Finally, the possible direction for future research is presented.
101
A survey of scheduling problems with setup times or costs
Ali Allahverdi, C.T. Ng, T.C.E. Cheng et al. · European Journal of Operational Research · 2006 · 1.3K citations · Full text
Management, Industrial Engineering, Operations Management +12