Early/tardy scheduling with sequence dependent setups on uniform parallel machines
From MaRDI portal
Publication:1302575
DOI10.1016/S0305-0548(98)00051-3zbMATH Open0947.90043OpenAlexW2033870051MaRDI QIDQ1302575FDOQ1302575
John J. Kanet, Nagraj Balakrishnan, V. Sridharan
Publication date: 8 November 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00051-3
Cited In (24)
- Hierarchical production planning and scheduling in a multi-product, batch process environment
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
- Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem
- Dispatching problems for parallel machines in the TFT‐LCD assembly process
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Scheduling job classes on uniform machines
- Dynamic routing strategies for JIT production in hybrid flow shops
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling
- Multi-machine scheduling lower bounds using decision diagrams
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A survey of scheduling problems with setup times or costs
- A comparison of lower bounds for the single-machine early/tardy problem
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- A tabu search algorithm for parallel machine total tardiness problem
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- Earliness-tardiness scheduling with setup considerations
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
This page was built for publication: Early/tardy scheduling with sequence dependent setups on uniform parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302575)
