Genetic search with dynamic operating disciplines

DOI10.1016/0305-0548(94)90022-1zbMath0814.90054OpenAlexW2061230841MaRDI QIDQ1342112

V. Pereyra

Publication date: 11 January 1995

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

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90022-1

zbMATH Keywords

earlinesstardinessgenetic searchsingle-machine deterministic scheduling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Neural networks for/in biological studies, artificial life and related topics (92B20)

Related Items (1)

Enhanced genetic operators for the resolution of discrete constrained optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Single- and multiple-processor models for minimizing completion time variance
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

This page was built for publication: Genetic search with dynamic operating disciplines