Pages that link to "Item:Q1111923"

The following pages link to A survey of priority rule-based scheduling (Q1111923):

Displaying 49 items.

• Machine scheduling in underground mining: an application in the potash industry (Q280169) (← links)
• Dispatching rule selection with Gaussian processes (Q301496) (← links)
• Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173) (← links)
• Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm (Q454950) (← links)
• Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung (Q806849) (← links)
• Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
• An improved constraint satisfaction adaptive neural network for job-shop scheduling (Q969749) (← links)
• Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• The complexity of multidimensional periodic scheduling (Q1281399) (← links)
• Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
• List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
• Dynamic non-preemptive single machine scheduling (Q1360133) (← links)
• Look ahead job demanding for improving job shop performance (Q1374406) (← links)
• An efficient genetic algorithm for job shop scheduling with tardiness objectives. (Q1427583) (← links)
• A large step random walk for minimizing total weighted tardiness in a job shop (Q1579121) (← links)
• The disjunctive graph machine representation of the job shop scheduling problem (Q1590037) (← links)
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
• A comparative study of dispatching rules in dynamic flowshops and jobshops (Q1610138) (← links)
• On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
• A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
• A worker constrained flexible job shop scheduling problem with sequence-dependent setup times (Q1733093) (← links)
• A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
• A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop (Q1762116) (← links)
• Insertion techniques for the heuristic solution of the job shop problem (Q1805458) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Development and analysis of cost-based dispatching rules for job shop scheduling (Q1877051) (← links)
• Executing production schedules in the face of uncertainties: a review and some future directions (Q1887777) (← links)
• A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates (Q1956018) (← links)
• Job scheduling of diffusion furnaces in semiconductor fabrication facilities (Q2140148) (← links)
• Machine scheduling in production: a content analysis (Q2294174) (← links)
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
• A memetic algorithm for the job-shop with time-lags (Q2468490) (← links)
• Petri net based scheduling (Q2564338) (← links)
• Optimizing makespan and stability risks in job shop scheduling (Q2664315) (← links)
• Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints (Q2669504) (← links)
• An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning (Q2672113) (← links)
• Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis (Q3163224) (← links)
• A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches (Q3163273) (← links)
• New expression of scheduling performance measures (Q3527929) (← links)
• An online approach to dynamic rescheduling for production planning applications (Q3533208) (← links)
• On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems (Q4649211) (← links)
• Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs (Q4655459) (← links)
• A study on the performance of scheduling rules in buffer-constrained dynamic flowshops (Q4707446) (← links)
• Cooperative dispatching -- exploiting the flexibility of an FMS by means of incremental optimization (Q5925941) (← links)
• A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs (Q5935393) (← links)
• An effective hybrid optimization strategy for job-shop scheduling problems (Q5936137) (← links)
• Scheduling wagons to unload in bulk cargo ports with uncertain processing times (Q6068691) (← links)
• Application of quantum approximate optimization algorithm to job shop scheduling problem (Q6113354) (← links)