A recovering beam search algorithm for the single machine just-in-time scheduling problem

DOI10.1016/J.EJOR.2004.11.014MaRDI QIDQ2488909zbMATH OpenOpenAlexFDO

Authors B. Esteve, C. Aubijoux, A. Chartier, Vincent T'kindt

Publication date 16 May 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2004.11.014

zbMATH Keywords

Just-in-time schedulingMulticriteria optimisationRecovering beam search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Management decision making, including multiple objectives (90B50)

Recommendations

• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• A note on just-in-time scheduling on flow shop machines
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups

Cites work

• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
• A heuristic for single machine scheduling with early and tardy costs
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Earliness-Tardiness Scheduling Around Almost Equal Due Dates
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Multicriteria scheduling problems: a survey
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimal timing schedules in earliness-tardiness single machine sequencing
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Performance enhancements to tabu search for the early/tardy scheduling problem
• PERT scheduling with convex cost functions.
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single-machine scheduling with early and tardy completion costs
• The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
• The Single Machine Early/Tardy Problem

Cited in

(20)

• The one-machine just-in-time scheduling problem with preemption
• Job shop scheduling with beam search
• A meta-heuristic to solve the just-in-time job-shop scheduling problem
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem
• A multi-objective optimization for preemptive identical parallel machines scheduling problem
• Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
• A survey on scheduling problems with due windows
• A beam search algorithm for minimizing crane times in premarshalling problems
• Multicriteria models for just-in-time scheduling
• An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal
• A single machine scheduling problem with two-dimensional vector packing constraints
• Practical solutions for a dock assignment problem with trailer transportation
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• Improving schedule stability in single-machine rescheduling for new operation insertion
• A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

This page was built for publication: A recovering beam search algorithm for the single machine just-in-time scheduling problem

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