Makespan minimization for parallel machines scheduling with multiple availability constraints

Navid Hashemian; Claver Diallo; Béla Vízvári

doi:10.1007/s10479-012-1059-8

ScienceGate Book Chapters

JOURNAL ARTICLE

Makespan minimization for parallel machines scheduling with multiple availability constraints

Navid Hashemian Claver Diallo Béla Vízvári

Year: 2012 Journal: Annals of Operations Research Vol: 213 (1)Pages: 173-186 Publisher: Springer Science+Business Media

DOI: 10.1007/s10479-012-1059-8

Get Full-Text PDF Get Analytical Report

Keywords:

Job shop scheduling Lexicographical order Theory of computation Mathematical optimization Enumeration Computer science Minification Integer programming Scheduling (production processes) Branch and bound Linear programming Algorithm Mathematics Schedule Discrete mathematics

Metrics

Cited By

4.04

FWCI (Field Weighted Citation Impact)

Refs

0.93

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Scheduling and Optimization Algorithms

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Assembly Line Balancing Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Makespan minimization for parallel machines scheduling with multiple availability constraints

Metrics

Citation History

Topics

Related Documents

Makespan minimization for two parallel machines scheduling with a periodic availability constraint

Online makespan minimization for MapReduce scheduling on multiple parallel machines

Makespan minimization for two parallel machines with unavailability constraints

Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints

Makespan minimization for two parallel machines with an availability constraint