Scheduling with controllable processing times and compression costs using population-based heuristics

DOI10.1080/00207540903433874MaRDI QIDQ3168916zbMATH OpenOpenAlexFDO

Authors Andreas C. Nearchou

Publication date 27 April 2011

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207540903433874

zbMATH Keywords

controllable processing timescrash costsdifferential evolutionevolution strategiesgenetic and evolutionary algorithmsmeta-heuristicsschedulingswarm intelligence

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• Scheduling to minimize the total compression and late costs
• Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• Single machine scheduling problems with controllable processing times and total absolute differences penalties

Cites work

• A bicriterion approach to time/cost trade-offs in sequencing
• A survey of results for sequencing problems with controllable processing times
• A survey of scheduling with controllable processing times
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 1391176 (Why is no real title available?)
• Introduction to evolutionary computing
• Multicriteria scheduling
• Recent approaches to global optimization problems through particle Swarm optimization
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case
• Single-machine sequencing with controllable processing times
• Some comments on sequencing with controllable processing times
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Two parallel machine sequencing problems involving controllable job processing times

Cited in

(1)

• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources

This page was built for publication: Scheduling with controllable processing times and compression costs using population-based heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168916)