scientific article; zbMATH DE number 1305705

zbMATH Open0918.90120MaRDI QIDQ4252525FDOQ4252525

Authors: D. E. Joslin, D. P. Clements 

Publication date: 20 June 1999

Title of this publication is not available (Why is that?)

Recommendations

• On the Greedy Solution of Ordering Problems
• Intractability and analysis of heuristics for discrete optimization. II
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 2119736

zbMATH Keywords

squeaky wheel optimization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27) Production models (90B30)

Cited In (28)

• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• Generalised graph colouring by a hybrid of local search and constraint programming
• Improved sequential insertion heuristics for berth allocation problems
• Resource constrained routing and scheduling: review and research prospects
• Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
• Multi-machine energy-aware scheduling
• On service consistency in multi-period vehicle routing
• AFSCN scheduling: how the problem and solution have evolved
• Graph coloring by multiagent fusion search
• Squeezing Feasibility
• Optimization of stowage plans for RoRo ships
• Metaheuristic approaches for the berth allocation problem
• A constructive approach to examination timetabling based on adaptive decomposition and ordering
• Preprocessing and an improved MIP model for examination timetabling
• A squeaky wheel optimisation methodology for two-dimensional strip packing
• Adaptive linear combination of heuristic orderings in constructing examination timetables
• A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain
• The Relation Between Complete and Incomplete Search
• An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
• Applying the threshold accepting metaheuristic to~curriculum based course timetabling
• A survey on vertex coloring problems
• A cellular memetic algorithm for the examination timetabling problem
• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
• A Pareto-based search methodology for multi-objective nurse scheduling
• Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
• Dynamic evolution of squeezing maintenance
• An evolutionary approach for bandwidth multicoloring problems
• A critical-shaking neighborhood search for the yard allocation problem

This page was built for publication:

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