Pages that link to "Item:Q811337"

The following pages link to Mathematical programming formulations for machine scheduling: A survey (Q811337):

Displaying 32 items.

• MP or not MP: that is the question (Q283264) (← links)
• Job-shop production scheduling with reverse flows (Q319298) (← links)
• Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
• Evaluation of mathematical models for flexible job-shop scheduling problems (Q350406) (← links)
• Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
• Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360) (← links)
• Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
• Minimizing total completion time for preemptive scheduling with release dates and deadline constraints (Q902745) (← links)
• Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
• Scheduling identical jobs on uniform parallel machines under position-based learning effects (Q1637750) (← links)
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
• A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
• Minimizing the makespan on two identical parallel machines with mold constraints (Q1722974) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← 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)
• Simplifying dispatching rules in genetic programming for dynamic job shop scheduling (Q2163788) (← links)
• An application of dynamic programming to assign pressing tanks at wineries (Q2189941) (← links)
• Optimizing the physician scheduling problem in a large hospital ward (Q2197320) (← links)
• Terminal inventory level constraints for online production scheduling (Q2239846) (← links)
• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem (Q2485171) (← links)
• Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters (Q2676401) (← links)
• A study of integer programming formulations for scheduling problems (Q3124684) (← links)
• Model formulations for the machine scheduling problem with limited waiting time constraints (Q3429070) (← links)
• Project scheduling under the threat of catastrophic disruption (Q6112627) (← links)
• A systematic review of multi-objective hybrid flow shop scheduling (Q6112731) (← links)
• Application of quantum approximate optimization algorithm to job shop scheduling problem (Q6113354) (← links)
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)