Pages that link to "Item:Q919993"
From MaRDI portal
The following pages link to Minimizing the number of tardy job units under release time constraints (Q919993):
Displaying 35 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- A single machine scheduling problem to minimize total early work (Q342425) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Single-machine scheduling with stepwise tardiness costs and release times (Q656444) (← links)
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
- Minimizing the number of tardy jobs in single machine sequencing (Q686166) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (Q839781) (← links)
- A faster algorithm for the maximum weighted tardiness problem (Q916393) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (Q1120271) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- Minimizing the weighted number of tardy task units (Q1329790) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance (Q1761146) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
- A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem (Q2275945) (← links)
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines (Q2806872) (← links)
- Subdivision-based digital geometry processing as a fundamental building block of digital manufacturing (Q3012641) (← links)
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
- Scheduling to minimize release-time resource consumption and tardiness penalties (Q4865764) (← links)
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
- Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
- Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)
- Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines (Q6551117) (← links)
