Pages that link to "Item:Q3824090"

The following pages link to One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties (Q3824090):

Displaying 50 items.

• Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
• Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling (Q337595) (← links)
• Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728) (← links)
• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
• Supply planning models for a remanufacturer under just-in-time manufacturing environment with reverse logistics (Q512915) (← links)
• Single machine flow-time scheduling with scheduled maintenance (Q811593) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
• A comparison of lower bounds for the single-machine early/tardy problem (Q868992) (← links)
• An improved earliness--tardiness timing algorithm (Q878565) (← links)
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
• Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570) (← links)
• Scheduling with returnable containers (Q906554) (← links)
• Dynamic programming approach to the single-machine sequencing problem with different due-dates (Q913669) (← links)
• Efficient algorithms for machine scheduling problems with earliness and tardiness penalties (Q940876) (← links)
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
• Boundary labeling with octilinear leaders (Q970611) (← links)
• The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties (Q1017438) (← links)
• The transportation problem with exclusionary side constraints (Q1022437) (← links)
• Non-approximability of just-in-time scheduling (Q1041346) (← links)
• Vehicle scheduling with combinable delivery and pickup operations (Q1043247) (← links)
• Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars (Q1046123) (← links)
• A fixed interval due-date scheduling problem with earliness and due-date costs (Q1127177) (← links)
• Equivalence of mean flow time problems and mean absolute deviation problems (Q1173904) (← links)
• Scheduling around a small common due date (Q1183621) (← links)
• Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482) (← links)
• Single-machine scheduling with time windows and earliness/tardiness penalties (Q1278201) (← links)
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
• Scheduling with batch setup times and earliness-tardiness penalties (Q1278527) (← links)
• An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs (Q1315994) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• Genetic search with dynamic operating disciplines (Q1342112) (← links)
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
• Modelling and solving the production rate variation problem (PRVP) (Q1383316) (← links)
• A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
• The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← links)
• A heuristic for single machine scheduling with early and tardy costs (Q1592742) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395) (← links)
• Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
• Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence (Q1702665) (← links)
• Scheduling with time-dependent discrepancy times (Q1702735) (← links)
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
• A note on a due-date assignment on a two-machine flow-shop (Q1765554) (← links)