Pages that link to "Item:Q5575251"
From MaRDI portal
The following pages link to Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm (Q5575251):
Displaying 50 items.
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations (Q309061) (← links)
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) (← links)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- Fuzzy job-shop scheduling problems: a review (Q506738) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem (Q747040) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- Minimizing total weighted tardiness in a generalized job shop (Q880516) (← links)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
- A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem (Q1129955) (← links)
- One-machine rescheduling heuristics with efficiency and stability as criteria (Q1201849) (← links)
- A unified formulation of the machine scheduling problem (Q1245650) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- On a multiconstrained model for chromatic scheduling (Q1293198) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- Benchmarks for shop scheduling problems (Q1296703) (← 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)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Effective job shop scheduling through active chain manipulation (Q1342330) (← links)
- Mixed graph colorings (Q1360876) (← links)
- A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
- Heuristics for minimizing total weighted tardiness in flexible flow shops (Q1567299) (← links)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
- Decomposition methods for large job shops (Q1592580) (← links)
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← links)
- A tabu search approach to machine scheduling (Q1609892) (← links)
- A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times (Q1643055) (← links)
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling (Q1695036) (← links)
- Complexity, bounds and dynamic programming algorithms for single track train scheduling (Q1730675) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- A new hybrid genetic algorithm for job shop scheduling problem (Q1761165) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Job-shop scheduling with resource-time models of operations (Q1820680) (← links)
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer (Q1820682) (← links)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- Two alternative models for farm management: Discrete versus continuous time horizon (Q1869414) (← links)
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems (Q1954823) (← links)
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
- A new energy-aware flexible job shop scheduling method using modified biogeography-based optimization (Q1993083) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
- Considering project management activities for engineering design groups (Q2226486) (← links)
- Nested partitions for the large-scale extended job shop scheduling problem (Q2271832) (← links)
- A tabu search experience in production scheduling (Q2366998) (← links)
- Routing and scheduling in a flexible job shop by tabu search (Q2366999) (← links)
