An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
From MaRDI portal
Publication:5548719
DOI10.1287/mnsc.15.1.102zbMath0164.20002OpenAlexW2010484711MaRDI QIDQ5548719
Publication date: 1968
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.15.1.102
Related Items (only showing first 100 items - show all)
Single machine scheduling with assignable due dates ⋮ An ordered independence system and its applications to scheduling problems ⋮ Scheduling jobs under simple linear deterioration ⋮ Incorporating preference information into multi-objective scheduling ⋮ The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Online production planning to maximize the number of on-time orders ⋮ New algorithms for minimizing the weighted number of tardy jobs on a single machine ⋮ Timetabling of sorting slots in a logistic warehouse ⋮ Multitasking via alternate and shared processing: algorithms and complexity ⋮ Single-machine scheduling with trade-off between number of tardy jobs and compression cost ⋮ Maximizing the weighted number of just-in-time jobs in flow shop scheduling ⋮ Minimizing the number of tardy jobs with stochastically-ordered processing times ⋮ Minimizing the number of late jobs in a stochastic setting using a chance constraint ⋮ Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property ⋮ Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs ⋮ Flowshop scheduling with dominant machines ⋮ Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs ⋮ Scheduling on machines with variable service rates ⋮ Lawler's minmax cost algorithm: optimality conditions and uncertainty ⋮ Resource loading with time windows ⋮ Minimizing the weighted number of tardy jobs on a single machine with release dates ⋮ Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness ⋮ Single machine scheduling with interfering job sets ⋮ Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs ⋮ Single-machine scheduling with trade-off between number of tardy jobs and resource allocation ⋮ Patient scheduling with periodic deteriorating maintenance on single medical device ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Approximate algorithms for the \(P\parallel C_{\max}\) problem ⋮ On single processor scheduling problems with learning dependent on the number of processed jobs ⋮ Single machine scheduling with discretely controllable processing times ⋮ Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints ⋮ k-optimal solution sets for some polynomially solvable scheduling problems ⋮ A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop ⋮ Some single-machine scheduling problems with actual time and position dependent learning effects ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Single processor scheduling with job values depending on their completion times ⋮ Minimizing the number of tardy jobs for \(m\) parallel machines ⋮ Single machine scheduling problems with subcontracting options ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ Minimizing late jobs in the general one machine scheduling problem ⋮ Algorithms for some maximization scheduling problems on a single machine ⋮ Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process ⋮ Scheduling satellite launch missions: an MILP approach ⋮ Multi-criteria scheduling: an agent-based approach for expert knowledge integration ⋮ A study of single-machine scheduling problem to maximize throughput ⋮ A note on reverse scheduling with maximum lateness objective ⋮ Complexity results for scheduling chains on a single machine ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ On bilevel machine scheduling problems ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem ⋮ On the complexity of bi-criteria scheduling on a single batch processing machine ⋮ New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem ⋮ Algorithms and complexity analysis for robust single-machine scheduling problems ⋮ Genetic algorithms to minimize the weighted number of late jobs on a single machine. ⋮ Minimizing the weighted number of tardy jobs on a two-machine flow shop. ⋮ Single machine scheduling to minimize the number of late jobs under uncertainty. ⋮ A note on ``Single-machine scheduling with general learning functions ⋮ A note on the maximum number of on-time jobs on parallel identical machines. ⋮ A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs ⋮ Erratum to ``Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects [Appl. Math. Modelling 35 (2011) 1388-1395] ⋮ Minimizing the number of late jobs on a single machine under due date uncertainty ⋮ On the complexity of generalized due date scheduling problems ⋮ Performance guarantees for a scheduling problem with common stepwise job payoffs ⋮ A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop ⋮ A note: minimizing maximum earliness on a proportionate flowshop ⋮ Single-machine scheduling against due dates with past-sequence-dependent setup times ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ Minimizing the number of late jobs for the permutation flowshop problem with secondary resources ⋮ Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming ⋮ Scheduling problem with multi-purpose parallel machines ⋮ Complexity of single machine scheduling problems under scenario-based uncertainty ⋮ Bicriterion scheduling with equal processing times on a batch processing machine ⋮ Fuzzy job-shop scheduling problems: a review ⋮ Single-machine scheduling under the job rejection constraint ⋮ Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects ⋮ Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances ⋮ Minimizing number of tardy jobs on a batch processing machine with incompatible job families ⋮ Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs ⋮ Complexity results for flow shop problems with synchronous movement ⋮ Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility ⋮ Isomorphic scheduling problems ⋮ Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs ⋮ Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries ⋮ Single machine scheduling subject to deadlines and resource dependent processing times ⋮ A note on a single machine scheduling problem with generalized total tardiness objective function ⋮ Priority algorithms for the subset-sum problem ⋮ Parallel machine scheduling with a common server ⋮ Single machine scheduling problems with position-dependent processing times ⋮ Parallel machine scheduling with splitting jobs ⋮ The counting complexity of a simple scheduling problem ⋮ Scheduling jobs under decreasing linear deterioration ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ⋮ An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs ⋮ Parallel machine scheduling to minimize costs for earliness and number of tardy jobs ⋮ Minimizing the number of late jobs on unrelated machines ⋮ Single-machine scheduling to minimize earliness and number of tardy jobs ⋮ An optimal scheduling algorithm for preemptable real-time tasks ⋮ Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints ⋮ The coordination of scheduling and batch deliveries
This page was built for publication: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
