Nested partitions for the large-scale extended job shop scheduling problem

Hoksung Yau; Leyuan Shi

doi:10.1007/s10479-008-0370-x

ScienceGate Book Chapters

JOURNAL ARTICLE

Nested partitions for the large-scale extended job shop scheduling problem

Hoksung Yau Leyuan Shi

Year: 2008 Journal: Annals of Operations Research Vol: 168 (1)Pages: 23-39 Publisher: Springer Science+Business Media

DOI: 10.1007/s10479-008-0370-x

Get Full-Text PDF Get Analytical Report

Keywords:

Theory of computation Computer science Scheduling (production processes) Job shop scheduling Mathematical optimization Job shop Flow shop scheduling Mathematics Algorithm Schedule

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.14

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

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Nested partitions for the large-scale extended job shop scheduling problem

Metrics

Citation History

Topics

Related Documents

Hybrid Nested Partitions algorithm for scheduling in job shop problem

A hybrid nested partitions algorithm for scheduling flexible resource in flow shop problem

Performance of Extended Local Clustering Organization (LCO) for Large Scale Job-Shop Scheduling Problem (JSP)

Fitness-Based PSO for Large-Scale Job-Shop Scheduling Problem

A Hybrid Nested Partitions Method for Bi-objective Job Shop Scheduling Problem Considering Energy Consumption and Makespan