An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times-Reference-Cited by-同舟云学术

An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times

Published:2012-11 Issue:11 Volume:39 Page:2659-2665
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Kalczynski Pawel J.,Kamburowski Jerzy

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference31 articles.

1. Complexity and approximation: combinatorial optimization problems and their approximability properties;Ausiello,1999

2. A review of machine scheduling: complexity, algorithms and approximability;Chen,1998

3. Schuurman P, Woeginger GJ. Approximation schemes—a tutorial. In: Moehring RH, Potts CN, Schulz AS, Woeginger GJ, Wolsey LA, editors. Lectures on scheduling; 2007 [available online].

4. Approximation algorithms;Vazirani,2001

5. Probabilistic analysis of unit-demand vehicle routing problems;Bompadre;Journal of Applied Probability,2007

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Two-Step Approach to Scheduling a Class of Two-Stage Flow Shops in Automotive Glass Manufacturing;Machines;2023-02-15

2. Adaptive genetic algorithm for two-stage hybrid flow-shop scheduling with sequence-independent setup time and no-interruption requirement;Expert Systems with Applications;2022-12

3. Makespan Minimization in Data Gathering Networks with Dataset Release Times;Parallel Processing and Applied Mathematics;2020

4. Multi-criteria blocking flow shop scheduling problems: Formulation and performance analysis;Advances in Production Engineering & Management;2018-06-15

5. Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time;Applied Soft Computing;2016-03