The following pages link to Complex Scheduling (Q3511304):
Displaying 38 items.
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q280157) (← links)
- A flow-based tabu search algorithm for the RCPSP with transfer times (Q280159) (← links)
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting (Q337299) (← links)
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (Q342161) (← links)
- Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) (Q363579) (← links)
- Improved load balancing and resource utilization for the skill vehicle routing problem (Q395849) (← links)
- Production scheduling with alternative process plans (Q439374) (← links)
- Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
- Personnel scheduling: models and complexity (Q541689) (← links)
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs (Q693149) (← links)
- Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
- A random key based genetic algorithm for the resource constrained project scheduling problem (Q947946) (← links)
- IP models for round robin tournaments (Q955618) (← links)
- On project scheduling problem (Q1003084) (← links)
- Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499) (← links)
- A branching scheme for finding cost-minimal round robin tournaments (Q1011262) (← links)
- Scheduling interfering job sets on parallel machines (Q1042099) (← links)
- A Lagrangian approach for minimum cost single round robin tournaments (Q1762030) (← links)
- How to make OR-results available: A proposal for project scheduling (Q1897419) (← links)
- Coordinating multi-location production and customer delivery (Q1936790) (← links)
- Project scheduling under limited resources. Models, methods, and applications (Q1962879) (← links)
- Metric approach for finding approximate solutions of scheduling problems (Q2048806) (← links)
- Evaluating typical algorithms of combinatorial optimization to solve continuous-time based scheduling problem (Q2331454) (← links)
- The no-wait job shop with regular objective: a method based on optimal job insertion (Q2359802) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications (Q2434299) (← links)
- A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example (Q2514747) (← links)
- Project selection, scheduling and resource allocation with time dependent returns (Q2519075) (← links)
- Going to the core of hard resource-constrained project scheduling instances (Q2664304) (← links)
- An analysis of network and resource indicators for resource-constrained project scheduling problem instances (Q2668709) (← links)
- (Q4255366) (← links)
- A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem (Q5054168) (← links)
- The blocking job shop with rail-bound transportation (Q5963615) (← links)
- Linear integer programming model as mathematical ware for an optimal flow production planning system at operational scheduling stage (Q6078065) (← links)
- Simultaneous scheduling of replacement and repair of common components in operating systems. A multi-objective mathematical optimization model (Q6099440) (← links)
- A 4/3 OPT+2/3 approximation for big two-bar charts packing problem (Q6147752) (← links)
- A memetic algorithm for restoring feasibility in scheduling with limited makespan (Q6177176) (← links)
