Pages that link to "Item:Q909574"
From MaRDI portal
The following pages link to The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem (Q909574):
Displaying 12 items.
- Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach (Q4394329) (← links)
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria (Q4394375) (← links)
- A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem (Q4398985) (← links)
- (Q4495733) (← links)
- Scheduling in flowshops to minimize total tardiness of jobs (Q4671257) (← links)
- Simulated annealing algorithm for solving the single machine early/tardy problem (Q4895700) (← links)
- Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling (Q5426585) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm (Q5690288) (← links)
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs (Q5935393) (← links)
- Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs (Q5953158) (← links)
- Minimizing grid capacity in preemptive electric vehicle charging orchestration: complexity, exact and heuristic approaches (Q6069212) (← links)
