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

IFAC Proceedings Volumes
doi 10.3182/20120523-3-ro-2023.00326
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

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

South African Journal of Industrial Engineering
IndustrialManufacturing Engineering
2012English

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

Approximability of Two-Machine No-Wait Flowshop Scheduling With Availability Constraints

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2003English

-Approximation for Two-Machine No-Wait Flowshop Scheduling With Availability Constraints

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2003English

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

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1989English

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

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2002English

Editorial: The Jobs Crisis: Causes, Cures, Constraints

European Journal of Economics and Economic Policies: Intervention
EconomicsEconometricsFinance
2014English

Unrelated Machine Scheduling of Jobs With Uniform Smith Ratios

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy