Pages that link to "Item:Q1848398"
From MaRDI portal
The following pages link to Job-shop scheduling with blocking and no-wait constraints (Q1848398):
Displaying 50 items.
- Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers (Q339938) (← links)
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- Review of real-time vehicle schedule recovery methods in transportation services (Q490374) (← links)
- Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources (Q513559) (← links)
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
- A job-shop scheduling approach for optimising sugarcane rail operations (Q656056) (← links)
- Railway track allocation: Models and methods (Q657061) (← links)
- The flexible blocking job shop with transfer and set-up times (Q719021) (← links)
- Scheduling trains with small stretch on a unidirectional line (Q831686) (← links)
- Job-shop scheduling with limited capacity buffers (Q850665) (← links)
- Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
- Cyclic job shop scheduling problems with blocking (Q940885) (← links)
- A general model for cyclic machine scheduling problems (Q955322) (← links)
- A new neighborhood and tabu search for the blocking job shop (Q967433) (← 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)
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations (Q1652116) (← links)
- A hybrid metaheuristic algorithm to optimise a real-world robotic cell (Q1652331) (← links)
- A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem (Q1652413) (← links)
- An integrated approach for scheduling health care activities in a hospital (Q1681540) (← links)
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling (Q1695036) (← links)
- Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations (Q1717811) (← links)
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints (Q1743650) (← links)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas (Q1761201) (← links)
- A heuristic to schedule flexible job-shop in a glass factory (Q1772853) (← links)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- Air traffic flow management with layered workload constraints (Q2027028) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- Multiple train repositioning operations in a railyard network (Q2084317) (← links)
- Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays (Q2108176) (← links)
- Effective train routing selection for real-time traffic management: improved model and ACO parallel computing (Q2147150) (← links)
- A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances (Q2163779) (← links)
- Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs (Q2220346) (← links)
- Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
- Dispatching and coordination in multi-area railway traffic management (Q2257356) (← links)
- A sequencing approach for creating new train timetables (Q2267382) (← links)
- The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
- Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage (Q2320284) (← links)
- A heuristic approach to solving the train traffic re-scheduling problem in real time (Q2331466) (← links)
- A branch and bound algorithm for scheduling trains in a railway network (Q2371354) (← links)
- A disjunctive graph model and framework for constructing new train schedules (Q2379528) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem (Q2411179) (← links)
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking (Q2423281) (← links)
- Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← links)
