Pages that link to "Item:Q1315994"

The following pages link to Parallel machine scheduling to minimize costs for earliness and number of tardy jobs (Q1315994):

Displaying 42 items.

• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs (Q263077) (← links)
• Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
• A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) (← links)
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
• Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
• Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
• Two due date assignment problems in scheduling a single machine (Q867932) (← links)
• Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect (Q902764) (← links)
• Scheduling with earliness-tardiness penalties and parallel machines (Q941007) (← links)
• Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system (Q954048) (← 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)
• Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
• Single machine scheduling and due date assignment with positionally dependent processing times (Q1027580) (← links)
• A fixed interval due-date scheduling problem with earliness and due-date costs (Q1127177) (← links)
• Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness (Q1296374) (← links)
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines (Q1302575) (← links)
• Multiple-machine scheduling with earliness, tardiness and completion time penalties (Q1302709) (← links)
• Parallel machine scheduling with earliness and tardiness penalties (Q1304513) (← links)
• Single-machine scheduling to minimize earliness and number of tardy jobs (Q1321352) (← links)
• The complexity of scheduling job families about a common due date (Q1376265) (← links)
• Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. (Q1413824) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs (Q1761111) (← links)
• A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
• Parallel machine earliness and tardiness scheduling with proportional weights (Q1870834) (← links)
• Minimizing the weighted number of tardy jobs on parallel processors (Q1887912) (← links)
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
• Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness (Q2387248) (← links)
• Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine (Q2429059) (← links)
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function (Q2459388) (← links)
• Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs (Q2510197) (← links)
• Parallel machine scheduling problems considering regular measures of performance and machine cost (Q3582663) (← links)
• Scheduling multiple products on parallel machines with setup costs (Q3627937) (← links)
• Due-date assignment and early/tardy scheduling on identical parallel machines (Q4279269) (← links)
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties (Q4300228) (← links)
• Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed (Q4661118) (← links)
• Proportionate flow shop: New complexity results and models with due date assignment (Q5249462) (← links)
• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights (Q6059906) (← links)
• Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs (Q6112732) (← links)