APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 2204247

In more languages

Language	Label	Description	Also known as
English	APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS	scientific article; zbMATH DE number 2204247

Statements

scholarly article

APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (English)

Monaldo Mastrolilli

Roberto Solis-Oba

International Journal of Foundations of Computer Science

publication date

12 September 2005

MaRDI profile type

MaRDI publication profile

Complexity of scheduling problems with multi-purpose machines

Maximal Flow Through a Network

Better Approximation Guarantees for Job-Shop Scheduling

Flowshop and Jobshop Schedules: Complexity and Approximation

Bounds for Certain Multiprocessing Anomalies

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

Coordination Complexity of Parallel Price-Directive Decomposition

Approximation algorithms for combinatorial problems

A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems

On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Effective neighbourhood functions for the flexible job shop problem

Approximate Algorithms for the 0/1 Knapsack Problem

Bounding algorithm for the routing problem with arbitrary paths and alternative servers

Improved Approximation Algorithms for Shop Scheduling Problems

Short Shop Schedules

Identifiers

zbMATH Open document ID

10.1142/S0129054105003030

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:5315931

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5315931&oldid=34419396"