A two-machine flow shop scheduling problem with controllable job processing times-Reference-Cited by-同舟云学术

A two-machine flow shop scheduling problem with controllable job processing times

Published:1988-03 Issue:2 Volume:34 Page:208-220
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Nowicki Eugeniusz,Zdrzałka Stanisław

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference8 articles.

1. Theory of Scheduling;Conway,1967

2. Worst-case analysis of heuristic algorithms for scheduling and packing;Fisher,1982

3. Optimal two- and three-stage production schedules with setup times included;Johnson;Naval Research Logistics Quarterly,1954

4. Reducibility among combinatorial problems;Karp,1972

5. Complexity of sequencing problem;Ullman,1976

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

1. Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness;Computers & Operations Research;2022-09

2. Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches;Computers & Operations Research;2022-08

3. Single-machine scheduling with machine unavailability periods and resource dependent processing times;European Journal of Operational Research;2022-01

4. Minimizing the resource consumption of heterogeneous batch-processing machines using a copula-based estimation of distribution algorithm;Applied Soft Computing;2018-12

5. Flow shop scheduling with flexible processing times;OR Spectrum;2018-04-30