Pages that link to "Item:Q1201849"

The following pages link to One-machine rescheduling heuristics with efficiency and stability as criteria (Q1201849):

Displaying 32 items.

• Robust optimization for the cyclic hoist scheduling problem (Q300031) (← links)
• Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns (Q336423) (← links)
• Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance (Q337088) (← links)
• Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
• EA/G-GA for single machine scheduling problems with earliness/tardiness costs (Q400876) (← links)
• Rescheduling for machine disruption to minimize makespan and maximum lateness (Q490326) (← links)
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
• Scheduling for stability in single-machine production systems (Q835553) (← links)
• A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties (Q838299) (← links)
• Predictive-reactive scheduling for single surgical suite subject to random emergency surgery (Q887886) (← links)
• Analysis of reactive deadlock-free scheduling in flexible job shops (Q1028658) (← links)
• The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
• SIMULEX -- a multiattribute DSS to solve rescheduling problems (Q1339168) (← links)
• Rescheduling of identical parallel machines under machine eligibility constraints. (Q1399598) (← links)
• A production rescheduling expert simulation system (Q1577764) (← links)
• Using real time information for effective dynamic scheduling (Q1604065) (← links)
• Project scheduling under uncertainty: survey and research potentials (Q1772834) (← links)
• Match-up scheduling under a machine breakdown (Q1806884) (← links)
• The construction of stable project baseline schedules (Q1877894) (← links)
• Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
• A survey of dynamic scheduling in manufacturing systems (Q2268515) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization (Q2312327) (← links)
• A hybrid multi-objective immune algorithm for predictive and reactive scheduling (Q2398647) (← links)
• Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
• Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption (Q2434315) (← links)
• Meta-heuristics for stable scheduling on a single machine (Q2468477) (← links)
• Predictive-reactive scheduling on a single resource with uncertain future jobs (Q2482799) (← links)
• The complexity of machine scheduling for stability with a single disrupted job (Q2488217) (← links)
• Predictive-reactive strategy for identical parallel machine rescheduling (Q2669491) (← links)
• Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption (Q2792200) (← links)
• Resource allocation by means of project networks: Complexity results (Q3113509) (← links)