Pages that link to "Item:Q3735434"

The following pages link to Single- and multiple-processor models for minimizing completion time variance (Q3735434):

Displaying 40 items.

• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
• CON due-date determination and sequencing (Q908841) (← links)
• Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
• Dynamic programming approach to the single-machine sequencing problem with different due-dates (Q913669) (← links)
• A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
• Optimal common due-date with limited completion time deviation (Q1097833) (← links)
• Survey of scheduling research involving due date determination decisions (Q1111925) (← links)
• Equivalence of mean flow time problems and mean absolute deviation problems (Q1173904) (← links)
• Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← links)
• A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date (Q1195100) (← links)
• On the general solution for a class of early/tardy problems (Q1207204) (← links)
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date (Q1278532) (← links)
• Scheduling under a common due-date on parallel unrelated machines (Q1291766) (← links)
• Genetic search with dynamic operating disciplines (Q1342112) (← links)
• Multi-machine scheduling with variance minimization (Q1392562) (← links)
• A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094) (← links)
• Parallel machine earliness and tardiness scheduling with proportional weights (Q1870834) (← links)
• Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← links)
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time (Q1885972) (← links)
• Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
• An exact algorithm to minimize mean squared deviation of job completion times about a common due date (Q2356179) (← links)
• Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
• Job sequencing and due date assignment in a single machine shop with uncertain processing times (Q2383106) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date (Q2638926) (← links)
• Minimizing flowtime and missed due-dates in single-machine sequencing (Q2640435) (← links)
• Simultaneous optimization of efficiency and performance belance measures in single-machine scheduling problems (Q4287985) (← links)
• Multiple common due dates (Q4434513) (← links)
• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties (Q5936755) (← links)
• Minmax earliness-tardiness costs with unit processing time jobs (Q5937720) (← links)
• Self-adaptive biased differential evolution for scheduling against common due dates (Q6579091) (← links)