Pages that link to "Item:Q1327223"

The following pages link to A branch and bound algorithm for the job-shop scheduling problem (Q1327223):

Displaying 50 items.

• Dynamic resource allocation: a flexible and tractable modeling framework (Q299823) (← links)
• Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
• Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
• Scheduling of computational processes in real-time distributed systems with uncertain task execution times (Q395470) (← links)
• Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
• An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← links)
• Scheduling and constraint propagation (Q697570) (← links)
• Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
• Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
• Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
• A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246) (← links)
• New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
• A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
• Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
• Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
• Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
• Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← links)
• Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
• A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
• The job-shop problem and immediate selection (Q1339120) (← links)
• Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
• A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
• Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
• Look ahead job demanding for improving job shop performance (Q1374406) (← links)
• Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
• A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
• Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
• Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
• Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
• Decomposition methods for large job shops (Q1592580) (← links)
• A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
• A tabu search approach to machine scheduling (Q1609892) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• A competent memetic algorithm for complex scheduling (Q1761722) (← links)
• Maximization of solution flexibility for robust shop scheduling (Q1772837) (← links)
• Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453) (← links)
• Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357) (← links)
• A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system (Q2052988) (← links)
• Simplifying dispatching rules in genetic programming for dynamic job shop scheduling (Q2163788) (← links)
• Nested partitions for the large-scale extended job shop scheduling problem (Q2271832) (← links)
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
• A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)