A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
From MaRDI portal
Publication:2337385
Recommendations
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- scientific article; zbMATH DE number 811323
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
Cites work
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Benchmarks for basic scheduling problems
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- Bottleneck-focused scheduling for a hybrid flowshop
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- Foundations of bilevel programming
- Job shop scheduling with beam search
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- Metaheuristics -- the metaphor exposed
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- Minimizing total tardiness in permutation flowshops
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- New heuristics for total tardiness minimization in a flexible flowshop
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
- Permutation flow shop scheduling with earliness and tardiness penalties
- Scheduling
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Sequencing with Earliness and Tardiness Penalties: A Review
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
Cited in
(10)- An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts
- New efficient heuristics for scheduling open shops with makespan minimization
- Solving a large cutting problem in the glass manufacturing industry
- A metric approach for scheduling problems with minimizing the maximum penalty
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem
- An exact quadratic programming approach based on convex reformulation for seru scheduling problems
- A systematic review of permutation flow shop scheduling with due-date-related objectives
- A Q-learning-based variable greedy algorithm to minimize the sum of total earliness and tardiness in a no-wait flowshop scheduling problem
- A note on ``A constraint programming-based lower bounding procedure for the job shop scheduling problem
This page was built for publication: A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337385)
