X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
scheduling (32) 32
algorithms (17) 17
computer science, interdisciplinary applications (16) 16
engineering, industrial (16) 16
heuristic (16) 16
heuristics (16) 16
flowshop (15) 15
operations research & management science (15) 15
fliessfertigung (14) 14
sequencing problem (12) 12
permutations (11) 11
studies (11) 11
algorithm (10) 10
makespan (10) 10
operations research (10) 10
heuristik (9) 9
permutation (9) 9
tardiness (9) 9
analysis (8) 8
pfsp (8) 8
production scheduling (8) 8
iterated greedy algorithm (7) 7
mathematical models (7) 7
approximation (6) 6
flowtime (6) 6
job shops (6) 6
machine (6) 6
optimization (6) 6
computation (5) 5
fertigungszeit (5) 5
genetic algorithm (5) 5
high-performing heuristics (5) 5
neh (5) 5
prozesszeit (5) 5
scheduling problem (5) 5
shop (5) 5
jobs (4) 4
m-machine (4) 4
näherungsverfahren (4) 4
time (4) 4
2-stage (3) 3
allocation (3) 3
beam search (3) 3
computational evaluation (3) 3
computer science, artificial intelligence (3) 3
construction (3) 3
engineering, electrical & electronic (3) 3
greedy algorithms (3) 3
hospitals (3) 3
job shop scheduling (3) 3
makespan minimization (3) 3
mathematical problems (3) 3
oberer grenzwert (3) 3
permutation flowshop (3) 3
prüfstand (3) 3
schedules (3) 3
sequence-dependent setup (3) 3
single-machine (3) 3
suchalgorithmus (3) 3
surgery (3) 3
tabu search (3) 3
total completion time (3) 3
total flowtime (3) 3
approximate methods (2) 2
article subject (2) 2
assembly (2) 2
bee colony algorithm (2) 2
benchmarks (2) 2
chirurgie (2) 2
complexity (2) 2
composite heuristics (2) 2
computational mathematics (2) 2
constructive heuristics (2) 2
controllable processing times (2) 2
critical path (2) 2
customer satisfaction (2) 2
decision support systems (2) 2
entscheidungsunterstützungssystem (2) 2
flow shop (2) 2
flowtime minimization (2) 2
hybrid flow shop (2) 2
hybrid genetic algorithm (2) 2
industrial project management (2) 2
management science (2) 2
maschinenbelegung (2) 2
metaheuristics (2) 2
methods (2) 2
minimize (2) 2
minimize makespan (2) 2
multiple processors (2) 2
operationsraum (2) 2
permutation flowshops (2) 2
problem solving (2) 2
processing times (2) 2
processor scheduling (2) 2
production management (2) 2
project management (2) 2
rechenzeit (2) 2
rechnerisches ergebnis (2) 2
reduction (2) 2
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Computers & Industrial Engineering, ISSN 0360-8352, 03/2020, Volume 141, p. 106288
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 05/2020, Volume 282, Issue 3, pp. 858 - 872
Journal Article
Computers and Operations Research, ISSN 0305-0548, 12/2019, Volume 112, p. 104767
In this paper, we analyse several issues concerning the most efficient approximate algorithms for the permutation flowshop scheduling problem with makespan... 
NEH | Tie-breaking | Iterated greedy | Heuristics | Scheduling | Flow shop | Flowshop | MINIMIZE MAKESPAN | ALGORITHM | SHOP | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | OPTIMIZATION | ENGINEERING, INDUSTRIAL | Greedy algorithms | Permutations | Production scheduling | Algorithms | Job shops
Journal Article
Computers and Operations Research, ISSN 0305-0548, 05/2017, Volume 81, pp. 167 - 177
Journal Article
Computers & Operations Research, ISSN 0305-0548, 01/2017, Volume 77, p. 96
  The Permutation Flowshop Scheduling Problem with Makespan objective (PFSP-M) is known to be NP-hard for more than two machines, and literally hundreds of... 
Studies | Problem solving | Scheduling | Computational mathematics | Complexity theory
Journal Article
Computers & Operations Research, ISSN 0305-0548, 01/2017, Volume 77, pp. 96 - 96
The Permutation Flowshop Scheduling Problem with Makespan objective (PFSP-M) is known to be NP-hard for more than two machines, and literally hundreds of works... 
Permutations | Approximation | Equivalence | Computation | Feasibility | Mathematical models | Scheduling | Optimization
Journal Article
Expert Systems with Applications, ISSN 0957-4174, 12/2018, Volume 114, p. 345
This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have... 
Schedules | Problems | Permutations | Tabu search | Computational mathematics | Scheduling | Heuristic
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 03/2017, Volume 257, Issue 3, pp. 707 - 721
Journal Article
International Journal of Production Research, ISSN 0020-7543, 02/2015, Volume 53, Issue 4, pp. 1111 - 1123
Journal Article
Computers and Operations Research, ISSN 0305-0548, 09/2019, Volume 109, pp. 77 - 88
Journal Article
Computers and Operations Research, ISSN 0305-0548, 05/2014, Volume 45, pp. 60 - 67
The most efficient approximate procedures so far for the flowshop scheduling problem with makespan objective – i.e. the NEH heuristic and the iterated greedy... 
NEH | Scheduling | Flowshop | Heuristics | SHOP PROBLEM | MINIMIZE MAKESPAN | SEQUENCING PROBLEM | ALGORITHM | FLOWTIME | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SETUP TIMES | ENGINEERING, INDUSTRIAL | Algorithms | Permutations | Construction | Operations research | Approximation | Insertion | Central processing units | Heuristic
Journal Article
Computers & Operations Research, ISSN 0305-0548, 12/2015, Volume 64, p. 86
  This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed... 
Studies | Algorithms | Customer satisfaction | Job shops | Approximations | Production scheduling | Heuristic
Journal Article
Computers & Operations Research, ISSN 0305-0548, 08/2015, Volume 60, p. 27
  Since Johnson's seminal paper in 1954, scheduling jobs in a permutation flowshop has been receiving the attention of hundreds of practitioners and... 
Studies | Operations research | Manufacturers | Job shops | Production scheduling | Heuristic
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 03/2017, Volume 257, Issue 3, p. 707
  The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where... 
Studies | Operations research | Scheduling | Heuristic
Journal Article
Computers and Operations Research, ISSN 0305-0548, 08/2015, Volume 60, pp. 27 - 36
Since Johnson׳s seminal paper in 1954, scheduling jobs in a permutation flowshop has been receiving the attention of hundreds of practitioners and researchers,... 
NEH | Heuristics | PFSP | Scheduling | Flowshop | Tie-breaking mechanism | Tardiness | M-MACHINE | SEQUENCING PROBLEM | MAKESPAN | ALGORITHM | FLOWTIME MINIMIZATION | SHOP | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | JOBS | DATES | ENGINEERING, INDUSTRIAL | Permutations | Operations research | Approximation | Mathematical models | Decision analysis | Heuristic | Due dates
Journal Article
Computers & Operations Research, ISSN 0305-0548, 01/2015, Volume 53, p. 68
  This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of total completion time minimisation. Since this problem is... 
Studies | Mathematical problems | Job shops | Production scheduling | Heuristic
Journal Article
International Journal of Production Research, ISSN 0020-7543, 02/2015, Volume 53, Issue 4, p. 1111
  As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient... 
Studies | Mathematical problems | Work environment | Job shops | Optimization algorithms | Production scheduling | Heuristic
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 03/2019, Volume 273, Issue 2, pp. 401 - 417
Journal Article
Computers & Industrial Engineering, ISSN 0360-8352, 02/2020, Volume 140, p. 106223
In this paper, we address the two-stage multi-machine assembly scheduling problem, a layout consisting of several dedicated parallel machines in the first... 
Scheduling | Constructive heuristics | Total completion time | Assembly
Journal Article
Computers & Operations Research, ISSN 0305-0548, 11/2016, Volume 75, pp. 38 - 38
In this paper we address the problem of scheduling jobs in a permutation flowshop with a just-in-time objective, i.e. the minimisation of the sum of total... 
Permutations | Construction | Operations research | Seeds | Algorithms | Approximation | Scheduling | Heuristic
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.