Pages that link to "Item:Q1196724"

The following pages link to A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724):

Displayed 50 items.

• Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) ‎ (← links)
• Scheduling evacuation operations (Q309072) ‎ (← links)
• Network construction problems with due dates (Q319443) ‎ (← links)
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) ‎ (← links)
• A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) ‎ (← links)
• Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) ‎ (← links)
• Resource leveling in a machine environment (Q418090) ‎ (← links)
• A space-indexed formulation of packing boxes into a larger box (Q433833) ‎ (← links)
• A branch and cut heuristic for a runway scheduling problem (Q510289) ‎ (← links)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) ‎ (← links)
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) ‎ (← links)
• A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) ‎ (← links)
• Optimal solutions for a dock assignment problem with trailer transportation (Q744629) ‎ (← links)
• On a fix-and-relax framework for a class of project scheduling problems (Q817205) ‎ (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) ‎ (← links)
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) ‎ (← links)
• Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) ‎ (← links)
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) ‎ (← links)
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) ‎ (← links)
• On stochastic dynamic programming for solving large-scale planning problems under uncertainty (Q1010297) ‎ (← links)
• A cutting plane algorithm for MV portfolio selection model (Q1036539) ‎ (← links)
• Scheduling interfering job sets on parallel machines (Q1042099) ‎ (← links)
• Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars (Q1046123) ‎ (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) ‎ (← links)
• MIP modelling of changeovers in production planning and scheduling problems (Q1278814) ‎ (← links)
• Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) ‎ (← links)
• A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) ‎ (← links)
• A cutting plane algorithm for a single machine scheduling problem (Q1590043) ‎ (← links)
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) ‎ (← links)
• On the strength of time-indexed formulations for the resource-constrained project scheduling problem (Q1728175) ‎ (← links)
• Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) ‎ (← links)
• The single machine weighted mean squared deviation problem (Q1753598) ‎ (← links)
• An exact approach for scheduling jobs with regular step cost functions on a single machine (Q1762077) ‎ (← links)
• LP models for bin packing and cutting stock problems (Q1847189) ‎ (← links)
• Two alternative models for farm management: Discrete versus continuous time horizon (Q1869414) ‎ (← links)
• Scheduling jobs of equal length: Complexity, facets and computational results (Q1919094) ‎ (← links)
• Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers (Q2077972) ‎ (← links)
• Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times (Q2147050) ‎ (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) ‎ (← links)
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem (Q2253398) ‎ (← links)
• An exact algorithm for single-machine scheduling without machine idle time (Q2268522) ‎ (← links)
• Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) ‎ (← links)
• The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) ‎ (← links)
• Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems (Q2393483) ‎ (← links)
• Novel formulations and modeling enhancements for the dynamic berth allocation problem (Q2424775) ‎ (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) ‎ (← links)
• Optimal spacecraft support in remote sensing missions (Q2477094) ‎ (← links)
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) ‎ (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) ‎ (← links)
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) ‎ (← links)