Four solution techniques for a general one machine scheduling problem. A comparative study
type: Item
instance of: scholarly article
title: Four solution techniques for a general one machine scheduling problem. A comparative study
zbMATH Open document ID: 0378.90044
DOI: 10.1016/0377-2217(78)90043-7
published in: European Journal of Operational Research
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 3590028
author: Luk N. Van Wassenhove
author: L. F. Gelders
MaRDI profile type: Publication
full work available at URL: 0377-2217(78)90043-7
OpenAlex ID: W1497265509
cites work: An experimental comparison of solution algorithms for the single-machine tardiness problem
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
cites work: Q5183254
cites work: Q4145425
cites work: Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure
cites work: Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
cites work: Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
cites work: Q4178782
cites work: Q4128238
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: Validation of subgradient optimization
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: Q4194705
cites work: Complexity of Scheduling under Precedence Constraints
cites work: Minimizing Total Costs in One-Machine Scheduling
cites work: Q3212909
cites work: Q4068433
cites work: P-Complete Approximation Problems
cites work: On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
cites work: A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
description: scientific article; zbMATH DE number 3590028