Pages that link to "Item:Q1111925"
From MaRDI portal
The following pages link to Survey of scheduling research involving due date determination decisions (Q1111925):
Displayed 50 items.
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates (Q1603337) (← links)
- Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints (Q1610141) (← links)
- Single machine scheduling with assignable due dates (Q1613425) (← links)
- Dynamic appointment scheduling with wait-dependent abandonment (Q1681154) (← links)
- Multi-attribute assignment of trains to departures in rolling stock management. Multi-attribute assignment of trains to departures in rolling stock management. A contribution to the EURO/ROADEF 2014 challenge (Q1730603) (← links)
- Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
- A tabu search algorithm for parallel machine total tardiness problem (Q1765548) (← links)
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
- Single machine scheduling to minimize total weighted tardiness (Q1772846) (← links)
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs (Q1807950) (← links)
- Makespan estimation in batch process industries: A comparison between regression analysis and neural networks (Q1869422) (← links)
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date (Q1887879) (← links)
- Processing-plus-wait due dates in single-machine scheduling (Q1893346) (← links)
- Common due-date determination and sequencing using tabu search (Q1915955) (← links)
- Single-machine scheduling with upper bounded maintenance time under the deteriorating effect (Q1956114) (← links)
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
- Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
- Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
- Trading off due-date tightness and job tardiness in a basic scheduling model (Q2356123) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
- Minimizing variation of production rates in just-in-time systems: A survey (Q2367376) (← links)
- Safe scheduling: Setting due dates in single-machine problems (Q2378451) (← links)
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance (Q2379661) (← links)
- Job sequencing and due date assignment in a single machine shop with uncertain processing times (Q2383106) (← links)
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine (Q2429059) (← links)
- Common due-date assignment and scheduling on single machine with exponential processing times. (Q2468636) (← links)
- A multi-objective lead time control problem in multistage assembly systems using an interactive method (Q2495993) (← links)
- Manufacturing lead time estimation using data mining (Q2496089) (← links)
- Selecting jobs for heavily loaded shop with lateness penalties (Q2563886) (← links)
- Batch scheduling and common due-date assignment on a single machine (Q2563922) (← links)
- Setting due dates in a stochastic single machine environment (Q2581610) (← links)
- Revenue management for operations with urgent orders (Q2629651) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Minimizing flowtime and missed due-dates in single-machine sequencing (Q2640435) (← links)
- Dynamic job shop scheduling for missed due date performance (Q3055352) (← links)
- A study of integer programming formulations for scheduling problems (Q3124684) (← links)
- Due date assignment using artificial neural networks under different shop floor control strategies (Q3159654) (← links)
- An on-time delivery improvement model for manufacturing organisations (Q3163349) (← links)
- Multi-agent-based workload control for make-to-order manufacturing (Q3533191) (← links)
- Using ensemble and metaheuristics learning principles with artificial neural networks to improve due date prediction performance (Q3605421) (← links)
- Maximizing set function formulation of two scheduling problems (Q4015963) (← links)
- Optimal assignment of NOP due-dates and sequencing in a single machine shop (Q4016862) (← links)
- Multiple common due dates (Q4434513) (← links)
- A Neural Network Model For The Common Due Date Job Scheduling On Unrelated Parallel Machines (Q4449517) (← links)
- Scheduling problems with random processing times under expected earliness/tardiness costs (Q4487018) (← links)
- Bicriteria scheduling for due date assignment with total weighted tardiness (Q4553877) (← links)
- Real-time due-date promising by build-to-order environments (Q4671325) (← links)