Four solution techniques for a general one machine scheduling problem. A comparative study
From MaRDI portal
Publication:1247365
DOI10.1016/0377-2217(78)90043-7zbMath0378.90044OpenAlexW1497265509MaRDI QIDQ1247365
Luk N. Van Wassenhove, L. F. Gelders
Publication date: 1978
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(78)90043-7
Related Items
On the flexibility of a decision theory-based heuristic for single machine scheduling, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, Multiple and bicriteria scheduling: A literature survey, Multi-criteria scheduling: an agent-based approach for expert knowledge integration, On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems, Multicriteria scheduling problems: a survey, Four solution techniques for a general one machine scheduling problem. A comparative study, A survey of algorithms for the single machine total weighted tardiness scheduling problem, Counting and enumeration complexity with application to multicriteria scheduling
Cites Work
- Four solution techniques for a general one machine scheduling problem. A comparative study
- A Dynamic Programming Approach to Sequencing Problems
- Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure
- Minimizing Total Costs in One-Machine Scheduling
- P-Complete Approximation Problems
- Complexity of Scheduling under Precedence Constraints
- An experimental comparison of solution algorithms for the single-machine tardiness problem
- Validation of subgradient optimization
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
- On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
