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

Studies in Informatics and Control - Romania
doi 10.24846/v23i1y201404
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ICI Bucharest

Related search

Exact and Heuristic Methods for Network Completion for Time-Varying Genetic Networks

BioMed Research International
ImmunologyMolecular BiologyBiochemistryMicrobiology MedicineGenetics
2014English

Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem

Mathematical Problems in Engineering
MathematicsEngineering
2016English

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

2016English

Rule Based Heuristic Approach for Minimizing Total Flow Time in Permutation Flow Shop Scheduling

Tehnicki Vjesnik
Engineering
2015English

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

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2002English

An Exact Extended Formulation for the Unrelated Parallel Machine Total Weighted Completion Time Problem

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2016English

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

Information Technology and Management Science
2019English

Fast Exact and Heuristic Methods for Role Minimization Problems

2008English

A Polynomial Time Constant Approximation for Minimizing Total Weighted Flow-Time

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy