Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

DOI10.1111/itor.13431OpenAlexW4391144352WikidataQ129417109 ScholiaQ129417109MaRDI QIDQ6195034

No author found.

Publication date: 12 March 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13431

zbMATH Keywords

branch-and-boundrelease datesdispatching rulesdue windowsjust-in-time schedulingsteel box girders

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• Single-machine scheduling with time windows and earliness/tardiness penalties
• Single machine earliness and tardiness scheduling
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
• An exact approach to early/tardy scheduling with release dates
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods
• Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• The one-machine problem with earliness and tardiness penalties
• Just-in-time scheduling for a distributed concrete precast flow shop system
• New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
• Minimizing Total Tardiness on One Machine is NP-Hard
• Sequencing with Earliness and Tardiness Penalties: A Review
• The Single Machine Early/Tardy Problem
• 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
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
• The integrated cutting and packing heterogeneous precast beams multiperiod production planning problem
• Matheuristics: survey and synthesis
• Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
• Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
• Algorithms for a two‐machine flowshop problem with jobs of two classes

This page was built for publication: Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders