Order acceptance using genetic algorithms (Q1000954)

From MaRDI portal

Revision as of 01:09, 29 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

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

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Order acceptance using genetic algorithms	scientific article

Statements

scholarly article

0 references

Order acceptance using genetic algorithms (English)

0 references

0 references

Susan A. Slotnick

0 references

Computers \& Operations Research

0 references

publication date

12 February 2009

0 references

full work available at URL

https://engagedscholarship.csuohio.edu/bus_facpub/53

0 references

zbMATH Keywords

order acceptance

0 references

genetic algorithms

0 references

scheduling

0 references

describes a project that uses

IMSL Numerical Libraries

0 references

MaRDI profile type

MaRDI publication profile

0 references

Selecting jobs for heavily loaded shop with lateness penalties

0 references

Multi-period job selection: Planning work loads to maximize profit

0 references

Order acceptance with weighted tardiness

0 references

0 references

Job selection in a heavily loaded shop

0 references

Greedy solutions of selection and ordering problems

0 references

Minimizing Total Tardiness on One Machine is NP-Hard

0 references

A cost model for justifying the acceptance of rush orders

0 references

Pricing and scheduling decisions with leadtime flexibility

0 references

Order acceptance strategies in a production-to-order environment with setup times and due-dates

0 references

An experimental comparison of capacity rationing models

0 references

Robustness of capacity rationing policies

0 references

Multicriteria order acceptance decision support in over-demanded job shops: A neural network approach

0 references

Makespan estimation and order acceptance in batch process industries when processing times are uncertain

0 references

Workload based order acceptance in job shop environments

0 references

Job selection and sequencing on a single machine in a random environment

0 references

A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs

0 references

A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows

0 references

Genetic algorithms to solve the cover printing problem

0 references

A continuous approach to considering uncertainty in facility design

0 references

Evolutionary bi-objective optimisation in the elevator car routing problem

0 references

Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem

0 references

A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study

0 references

An evolutionary algorithm approach to the share of choices problem in the product line design

0 references

A genetic algorithm approach to a nurse rerostering problem

0 references

A heuristic genetic algorithm for product portfolio planning

0 references

Bankruptcy theory development and classification via genetic programming

0 references

An efficient genetic algorithm for job shop scheduling with tardiness objectives.

0 references

Genetic algorithms to minimize the weighted number of late jobs on a single machine.

0 references

Flow-shop scheduling for three serial stations with the last two duplicate

0 references

A genetic algorithm for flow shop scheduling problems

0 references

Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics

0 references

Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families

0 references

Scheduling flexible flow lines with sequence-dependent setup times

0 references

Minimizing earliness and tardiness penalties in a single-machine problem with a common due date

0 references

Minimizing total earliness and tardiness on a single machine using a hybrid heuristic

0 references

Competitive genetic algorithms for the open-shop scheduling problem

0 references

A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints

0 references

Genetic Algorithms and Random Keys for Sequencing and Optimization

0 references

A comprehensive review and evaluation of permutation flowshop heuristics

0 references

A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

0 references

A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.cor.2008.04.010

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1000954

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