Pages that link to "Item:Q3778528"

The following pages link to The Shifting Bottleneck Procedure for Job Shop Scheduling (Q3778528):

Displaying 50 items.

• An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
• A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
• Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
• A new neighborhood and tabu search for the blocking job shop (Q967433) (← links)
• A heuristic for scheduling general job shops to minimize maximum lateness (Q969764) (← links)
• Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming (Q977004) (← links)
• Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
• Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
• Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
• Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
• Scheduling trains as a blocking parallel-machine job shop scheduling problem (Q1017462) (← links)
• An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances (Q1024078) (← links)
• An integrated tabu search algorithm for the lot streaming problem in job shops (Q1042155) (← links)
• A procedure for the one-machine sequencing problem with dependent jobs (Q1130073) (← links)
• A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724) (← links)
• One-machine rescheduling heuristics with efficiency and stability as criteria (Q1201849) (← links)
• Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
• A neural network model for scheduling problems (Q1268160) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• The generalized shifting bottleneck procedure (Q1268190) (← links)
• The life span method -- a new variant of local search (Q1275844) (← links)
• Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
• Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks (Q1278475) (← links)
• Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
• Benchmarks for shop scheduling problems (Q1296703) (← links)
• Heuristics for short route job shop scheduling problems (Q1298692) (← links)
• Deterministic job-shop scheduling problems with capacity focus (Q1308500) (← links)
• Cellular control of manufacturing systems (Q1309976) (← links)
• The job shop tardiness problem: A decomposition approach (Q1310711) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
• Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564) (← links)
• A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
• Preemptive scheduling with release dates, delivery times and sequence independent setup times (Q1331546) (← links)
• Integration of lotsizing and scheduling decisions in a job-shop (Q1331617) (← links)
• A decomposition approach for a resource constrained scheduling problem (Q1333515) (← links)
• The job-shop problem and immediate selection (Q1339120) (← links)
• An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal (Q1339130) (← links)
• Adjustment of heads and tails for the job-shop problem (Q1341994) (← links)
• A decision support system for the resource constrained project scheduling problem (Q1342050) (← links)
• A decomposition approach in a DSS for a resource constrained scheduling problem (Q1342055) (← links)
• A genetic algorithm for the job shop problem (Q1342314) (← links)
• Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
• Effective job shop scheduling through active chain manipulation (Q1342330) (← links)
• Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
• A fast finite loading algorithm for job oriented scheduling (Q1373899) (← links)
• Tabu-search for the multi-mode job-shop problem (Q1384220) (← links)
• Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
• An alternative framework to Lagrangian relaxation approach for job shop scheduling. (Q1399595) (← links)
• Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. (Q1400347) (← links)