Pages that link to "Item:Q1111925"
From MaRDI portal
The following pages link to Survey of scheduling research involving due date determination decisions (Q1111925):
Displaying 50 items.
- Pooling heterogeneous products for manufacturing environments (Q295883) (← links)
- Time-hierarchical scheduling. A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem (Q310327) (← links)
- An agent-based negotiation model on price and delivery date in a fashion supply chain (Q324332) (← links)
- Setting optimal due dates in a basic safe-scheduling model (Q336772) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times (Q505770) (← links)
- Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size (Q541698) (← links)
- The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (Q583101) (← links)
- Manufacturing lead-time rules: customer retention versus tardiness costs (Q706883) (← links)
- Optimization-based available-to-promise with multi-stage resource availability (Q816352) (← links)
- Scheduling flow shops using differential evolution algorithm (Q817560) (← links)
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
- A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
- Modelling complex assemblies as a queueing network for lead time control (Q858340) (← links)
- A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms (Q869182) (← links)
- A mixed integer programming model for advanced planning and scheduling (APS) (Q872302) (← links)
- A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem (Q913649) (← links)
- Dynamic programming approach to the single-machine sequencing problem with different due-dates (Q913669) (← links)
- Optimal assignment of slack due-dates and sequencing in a single-machine shop (Q917429) (← links)
- Single-machine scheduling with waiting-time-dependent due dates (Q933536) (← links)
- A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine (Q1022597) (← links)
- Due date assignment for multistage assembly systems (Q1024730) (← links)
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness (Q1038111) (← links)
- On a single-machine optimal constant due-date assignment and sequencing problem (Q1110452) (← links)
- Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem (Q1117832) (← links)
- Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine (Q1178637) (← links)
- Single-machine sequencing with controllable processing times (Q1194768) (← links)
- Optimal due-date assignment and sequencing (Q1197665) (← links)
- Common due date scheduling problem with separate earliness and tardiness penalties (Q1207207) (← links)
- Delivery time quotation and order processing with forbidden early shipments (Q1260740) (← links)
- A due date assignment algorithm for multiproduct manufacturing facilities (Q1261379) (← links)
- Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method (Q1266599) (← links)
- Manufacturing lead times, system utilization rates and lead-time-related demand (Q1266685) (← links)
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs (Q1268191) (← links)
- Scheduling with batch setup times and earliness-tardiness penalties (Q1278527) (← links)
- Scheduling with agreeable release times and due dates on a batch processing machine (Q1278533) (← links)
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method (Q1291768) (← links)
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness (Q1296374) (← links)
- Lead time selection and the behaviour of work flow in job shops (Q1296700) (← links)
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
- Minimizing flow time variance in a single machine system using genetic algorithms (Q1310012) (← links)
- A note on optimal assignment of slack due-dates in single-machine scheduling (Q1310016) (← links)
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs (Q1315994) (← links)
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment (Q1319566) (← links)
- Single-machine scheduling to minimize earliness and number of tardy jobs (Q1321352) (← links)
- Job shop leadtime requirements under conditions of controlled delivery performance (Q1333534) (← links)
