The following pages link to Vincent T'kindt (Q309070):
Displayed 49 items.
- Scheduling evacuation operations (Q309072) (← links)
- A hybrid heuristic approach for single machine scheduling with release times (Q336949) (← links)
- A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
- On an extension of the Sort \& Search method with application to scheduling theory (Q392015) (← links)
- Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
- (Q591804) (redirect page) (← links)
- Improving the preemptive bound for the single machine dynamic maximum lateness problem (Q614050) (← links)
- Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← links)
- (Q969754) (redirect page) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) (← links)
- (Q1734845) (redirect page) (← links)
- A local branching heuristic for solving a graph edit distance problem (Q1734846) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
- A constraint generation approach for two-machine shop problems with jobs selection (Q1751902) (← links)
- Minimizing the number of late jobs when the start time of the machine is variable (Q1758276) (← links)
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (Q1848361) (← links)
- Two-machine flowshop scheduling with a secondary criterion (Q1870802) (← links)
- Rescheduling for new orders on a single machine with setup times (Q1926981) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times (Q2102999) (← links)
- Single machine rescheduling for new orders with maximum lateness minimization (Q2147102) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- Scheduling batches in flowshop with limited buffers in the shampoo industry (Q2253374) (← links)
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) (← links)
- Minimizing the number of tardy jobs in two-machine settings with common due date (Q2410033) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Scheduling two agents on uniform parallel machines with~makespan and cost functions (Q2434250) (← links)
- Revisiting branch and bound search strategies for machine scheduling problems (Q2464435) (← links)
- A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
- Exact solution of the two-machine flow shop problem with three operations (Q2669696) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria (Q2892311) (← links)
- Multicriteria models for just-in-time scheduling (Q2997893) (← links)
- A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection (Q3195328) (← links)
- (Q3378953) (← links)
- (Q3425494) (← links)
- Erratum—One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons (Q3453334) (← links)
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem (Q4656749) (← links)
- (Q4670577) (← links)
- Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes (Q5002323) (← links)
- Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem (Q5111888) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5919958) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)