Fuzzy job-shop scheduling problems: a review (Q506738)

From MaRDI portal

Revision as of 03:03, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Fuzzy job-shop scheduling problems: a review	scientific article

Statements

scholarly article

0 references

Fuzzy job-shop scheduling problems: a review (English)

0 references

Salwani Abdullah

0 references

Majid Abdolrazzagh-Nezhad

0 references

Information Sciences

0 references

publication date

2 February 2017

0 references

zbMATH Keywords

fuzzy job-shop scheduling

0 references

review

0 references

meta-heuristic algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ins.2014.03.060

0 references

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

0 references

A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

0 references

Using dispatching rules for job shop scheduling with due date-based objectives

0 references

0 references

Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I

0 references

A Direct Search Method to Locate Negative Cycles in a Graph

0 references

Algorithms for Solving Production-Scheduling Problems

0 references

Future paths for integer programming and links to artificial intelligence

0 references

A Branch-Bound Solution to the General Scheduling Problem

0 references

Constraint-directed techniques for scheduling alternative activities

0 references

Job-shop scheduling using neural networks

0 references

Job-Shop Scheduling by Implicit Enumeration

0 references

A genetic algorithm for flexible job shop scheduling with fuzzy processing time

0 references

0 references

Linear Programming and Sequential Decisions

0 references

On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

0 references

An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

0 references

Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time

0 references

Metaheuristics: A bibliography

0 references

A Survey of Scheduling Rules

0 references

Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms

0 references

Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces

0 references

Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approach

0 references

Advances in Neural Networks – ISNN 2005

0 references

0 references

A very fast TS/SA algorithm for the job shop scheduling problem

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.INS.2014.03.060

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:506738

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q506738&oldid=38135940"