A Heuristic’s Job Order Gain in Pyramidal Preemptive Job Scheduling Problems for Total Weighted Completion Time Minimization

Information Technology and Management Science
doi 10.7250/itms-2019-0001
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Riga Technical University

Related search

Mathematical Formulations for Scheduling Jobs on Identical Parallel Machines With Family Setup Times and Total Weighted Completion Time Minimization

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2019English

Exact and Heuristic Methods for Minimizing the Total Completion Time in Job-Shops

Studies in Informatics and Control
Electronic EngineeringElectricalComputer Science
2014English

Flexible Job-Shop Scheduling Problems

English

A Global Constraint for Total Weighted Completion Time for Cumulative Resources

Engineering Applications of Artificial Intelligence
ControlSystems EngineeringElectricalArtificial IntelligenceElectronic Engineering
2008English

Determining Job Completion Time Distributions in Stochastic Production Environments

English

Integrating Job Parallelism in Real-Time Scheduling Theory

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

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

2020English

Scheduling Interviews for a Job Fair

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1990English

Weighted Tardiness Minimization in Job Shops With Setup Times by Hybrid Genetic Algorithm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy