A recovering beam search algorithm for the single machine just-in-time scheduling problem
From MaRDI portal
Publication:2488909
DOI10.1016/J.EJOR.2004.11.014zbMATH Open1111.90039OpenAlexW2069449667MaRDI QIDQ2488909FDOQ2488909
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
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
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- Multicriteria scheduling problems: a survey
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Single-machine scheduling with early and tardy completion costs
- The Single Machine Early/Tardy Problem
- Level Schedules for Mixed-Model, Just-in-Time Processes
- Optimal timing schedules in earliness-tardiness single machine sequencing
- The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
- A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- A heuristic for single machine scheduling with early and tardy costs
- PERT scheduling with convex cost functions.
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- Performance enhancements to tabu search for the early/tardy scheduling problem
- Earliness-Tardiness Scheduling Around Almost Equal Due Dates
Cited In (20)
- Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- A single machine scheduling problem with two-dimensional vector packing constraints
- Practical solutions for a dock assignment problem with trailer transportation
- A meta-heuristic to solve the just-in-time job-shop scheduling problem
- The one-machine just-in-time scheduling problem with preemption
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
- Improving schedule stability in single-machine rescheduling for new operation insertion
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- A survey on scheduling problems with due windows
- A beam search algorithm for minimizing crane times in premarshalling problems
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Job shop scheduling with beam search
- Multicriteria models for just-in-time scheduling
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
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)
