Pages that link to "Item:Q3478250"

The following pages link to Sequencing with Earliness and Tardiness Penalties: A Review (Q3478250):

Displaying 50 items.

• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Batching scheduling in a two-level supply chain with earliness and tardiness penalties (Q328087) (← links)
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
• A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• Setting optimal due dates in a basic safe-scheduling model (Q336772) (← links)
• Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance (Q337029) (← links)
• Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs (Q337279) (← links)
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties (Q339632) (← links)
• Robust newsvendor problem with autoregressive demand (Q342303) (← links)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Dynamic fleet scheduling with uncertain demand and customer flexibility (Q395693) (← links)
• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties (Q437059) (← links)
• Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times (Q505770) (← links)
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
• A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) (← links)
• Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← 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)
• On scheduling around large restrictive common due windows (Q704121) (← links)
• Algorithm for minimizing weighted earliness penalty in single-machine problem (Q706977) (← links)
• Scheduling flow shops using differential evolution algorithm (Q817560) (← links)
• Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
• A two-stage stochastic programming approach for project planning with uncertain activity durations (Q835555) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint (Q850651) (← links)
• Mean-range based distribution-free procedures to minimize ``overage'' and ``underage'' costs (Q852984) (← links)
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← 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)
• A comparison of lower bounds for the single-machine early/tardy problem (Q868992) (← links)
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264) (← links)
• A mixed integer programming model for advanced planning and scheduling (APS) (Q872302) (← links)
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
• Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon (Q879577) (← links)
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312) (← links)
• Due-window assignment problems with unit-time jobs (Q902534) (← links)
• Scheduling with returnable containers (Q906554) (← links)
• CON due-date determination and sequencing (Q908841) (← links)
• Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
• Distributed feedback control algorithm for dynamic truck loading scheduling problem (Q924413) (← links)
• Single machine stochastic JIT scheduling problem subject to machine breakdowns (Q931488) (← links)
• Single-machine scheduling against due dates with past-sequence-dependent setup times (Q933538) (← links)