Pages that link to "Item:Q3939582"

The following pages link to Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem (Q3939582):

Displaying 50 items.

• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs (Q263077) (← links)
• Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs (Q298499) (← links)
• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• An agent-based negotiation model on price and delivery date in a fashion supply chain (Q324332) (← links)
• A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
• Setting optimal due dates in a basic safe-scheduling model (Q336772) (← links)
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
• Scheduling with general position-based learning curves (Q424784) (← links)
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties (Q437059) (← links)
• New results on single-machine scheduling with past-sequence-dependent delivery times (Q441858) (← links)
• Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
• Resource constrained scheduling with general truncated job-dependent learning effect (Q511713) (← links)
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden (Q579120) (← links)
• Single machine multiple common due dates scheduling with learning effects (Q630690) (← links)
• Single-machine due-window assignment problem with learning effect and deteriorating jobs (Q639174) (← links)
• Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
• Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration (Q741381) (← links)
• Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect (Q830922) (← links)
• Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
• Single machine scheduling with past-sequence-dependent setup times and learning effects (Q845955) (← links)
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
• Two due date assignment problems in scheduling a single machine (Q867932) (← links)
• Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon (Q879577) (← links)
• CON due-date determination and sequencing (Q908841) (← links)
• Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
• Optimal due-date assignment and sequencing in a single machine shop (Q917427) (← links)
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
• A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties (Q943438) (← links)
• A note: Common due date assignment for a single machine scheduling with the rate-modifying activity (Q954028) (← links)
• A due-date assignment problem with learning effect and deteriorating jobs (Q967804) (← links)
• The capacity planning problem in make-to-order enterprises (Q970054) (← links)
• A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
• Due dates assignment and JIT scheduling with equal-size jobs (Q976442) (← links)
• A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
• Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences (Q980085) (← links)
• Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
• A multi-criteria scheduling with due-window assignment problem (Q1007672) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• Optimal total-work-content-power due-date determination and sequencing (Q1097161) (← links)
• An algorithm for the CON due-date determination and sequencing problem (Q1097162) (← links)
• Optimal common due-date with limited completion time deviation (Q1097833) (← links)
• Minimizing the maximum deviation of job completion time about a common due-date (Q1098766) (← links)
• An alternative proof of optimality for the common due-date assignment problem (Q1107429) (← links)
• Survey of scheduling research involving due date determination decisions (Q1111925) (← links)
• V-shape property of optimal sequence of jobs about a common due date on a single machine (Q1121777) (← links)
• Single-machine scheduling with learning considerations (Q1124688) (← links)
• A fixed interval due-date scheduling problem with earliness and due-date costs (Q1127177) (← links)