Heuristics for Minimizing the Number of Tardy Jobs on a Single Machine With Release Time

South African Journal of Industrial Engineering - South Africa
doi 10.7166/19-2-100
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Stellenbosch University

Related search

Technical Note—Single Machine Scheduling With Controllable Processing Times and Number of Jobs Tardy

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1989English

Minimizing the Weighted Number of Late Semi-Resumable Jobs With Deterministic Machine Availability Constraints

IFAC Proceedings Volumes
2012English

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

1996English

Meta-Heuristics for Stable Scheduling on a Single Machine

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2008English

On-Line Scheduling of Unit Time Jobs With Rejection: Minimizing the Total Completion Time

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2002English

Minimizing Total Tardiness for Single Machine Sequencing

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1996English

Minimizing Total Weighted Tardiness for the Single Machine Scheduling Problem With Dependent Setup Time and Precedence Constraints

Management Science Letters
AccountingManagementBusiness
2012English

Minimizing Total Completion Time in Flowshop With Availability Constraint on the First Machine

2016English

Hybrid Heuristics for the Single Machine Scheduling Problem With Quadratic Earliness and Tardiness Costs

International Journal of Machine Learning and Cybernetics
Computer VisionPattern RecognitionArtificial IntelligenceSoftware
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy