Pages that link to "Item:Q5548719"
From MaRDI portal
The following pages link to An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs (Q5548719):
Displaying 50 items.
- Timetabling of sorting slots in a logistic warehouse (Q284432) (← links)
- Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
- Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
- Resource loading with time windows (Q319369) (← links)
- Single machine scheduling with interfering job sets (Q336975) (← links)
- Patient scheduling with periodic deteriorating maintenance on single medical device (Q342021) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- On single processor scheduling problems with learning dependent on the number of processed jobs (Q350495) (← links)
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints (Q367232) (← links)
- Some single-machine scheduling problems with actual time and position dependent learning effects (Q376654) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Single machine scheduling problems with subcontracting options (Q385484) (← links)
- Scheduling satellite launch missions: an MILP approach (Q398832) (← links)
- Multi-criteria scheduling: an agent-based approach for expert knowledge integration (Q398857) (← links)
- A study of single-machine scheduling problem to maximize throughput (Q398860) (← links)
- A note on reverse scheduling with maximum lateness objective (Q398863) (← links)
- On bilevel machine scheduling problems (Q421065) (← links)
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- Performance guarantees for a scheduling problem with common stepwise job payoffs (Q476886) (← links)
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
- A note: minimizing maximum earliness on a proportionate flowshop (Q477650) (← links)
- Scheduling problem with multi-purpose parallel machines (Q496686) (← links)
- Fuzzy job-shop scheduling problems: a review (Q506738) (← links)
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects (Q534925) (← links)
- Algorithms for some maximization scheduling problems on a single machine (Q612210) (← links)
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem (Q630678) (← links)
- On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
- A note on ``Single-machine scheduling with general learning functions'' (Q639127) (← links)
- 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] (Q651795) (← links)
- Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256) (← links)
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
- Complexity results for flow shop problems with synchronous movement (Q726218) (← links)
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
- Isomorphic scheduling problems (Q744639) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- Minimizing the number of late jobs on unrelated machines (Q811339) (← links)
- The coordination of scheduling and batch deliveries (Q816348) (← links)
- Online production planning to maximize the number of on-time orders (Q829183) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
- Minimizing the number of tardy jobs with stochastically-ordered processing times (Q835573) (← links)
- Minimizing the number of late jobs in a stochastic setting using a chance constraint (Q835575) (← links)
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (Q839781) (← links)
- Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
- Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs (Q858442) (← links)
- Single processor scheduling with job values depending on their completion times (Q880588) (← links)
