Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming

DOI10.1016/0305-0548(92)90060-IzbMath0745.90033OpenAlexW2092265093MaRDI QIDQ1185994

Robert J. Chambers, Robert L. Carraway, Herbert Moskowitz, Thomas L. Morin

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(92)90060-i

zbMATH Keywords

schedulingmultiple performance measuresnonlinear multicriteria cost function

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Multicriteria scheduling using fuzzy theory and tabu search ⋮ Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time ⋮ A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single-sided economic screening models incorporating individual unit misclassification error and risk preference
• Generalized dynamic programming for multicriteria optimization
• Solving a bicriterion scheduling problem
• Hybrid algorithm for sequencing with bicriteria
• Proper efficiency and the theory of vector maximization
• Effect of Risk Aversion on Single Sample Attribute Inspection Plans
• Generalized Dynamic Programming for Stochastic Combinatorial Optimization
• Scheduling with Multiple Performance Measures: The One-Machine Case
• On the interactive solution to a multicriteria scheduling problem
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA
• Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• A note on a scheduling problem with dual criteria
• Branch-and-Bound Strategies for Dynamic Programming
• A dual algorithm for the one-machine scheduling problem
• Optimal project compression with due-dated events
• Composition Principles for Synthesis of Optimal Multistage Processes
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs