Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Fast LP models and algorithms for identical jobs on uniform parallel machines	scientific article

Statements

scholarly article

Fast LP models and algorithms for identical jobs on uniform parallel machines (English)

Applied Mathematical Modelling

publication date

6 December 2016

zbMATH Keywords

scheduling

identical jobs

uniform parallel machines

linear programming

algorithm

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.apm.2012.07.023

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

Scheduling equal-length jobs on identical parallel machines

A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

Equal processing and equal setup time cases of scheduling parallel machines with a single server

Minimizing the number of machines for scheduling jobs with equal processing times

Scheduling jobs with equal processing times and time windows on identical parallel machines

On a parallel machine scheduling problem with equal processing times

Scheduling identical jobs on uniform parallel machines

Mathematical programming formulations for machine scheduling: A survey

Scheduling identical jobs with chain precedence constraints on two uniform machines

A state-of-the-art review on scheduling with learning effects

Scheduling problems with a learning effect

Parallel machine scheduling with a learning effect

Scheduling with general job-dependent learning curves.

A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect

Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects

A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.

Minimizing the sum of absolute lateness in single-machine and multimachine scheduling

Minimizing the weighted number of tardy jobs on parallel processors

A decomposition algorithm for the single machine total tardiness problem

Scheduling unrelated parallel machines to minimize total weighted tardiness.

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.APM.2012.07.023

Sitelinks

Mathematics(1 entry)

mardi Publication:727360

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