Pages that link to "Item:Q4205231"
From MaRDI portal
The following pages link to On the Complexity of Scheduling with Batch Setup Times (Q4205231):
Displaying 45 items.
- Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times (Q2094381) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing (Q2140160) (← links)
- A survey of job shop scheduling problem: the types and models (Q2146994) (← links)
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (Q2285347) (← links)
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines (Q2317137) (← links)
- Single-machine scheduling with advanced process control constraints (Q2434278) (← links)
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs (Q2464440) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Learning and forgetting effects on a group scheduling problem (Q2467250) (← links)
- Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)
- Batch scheduling in a two-level supply chain -- a focus on the supplier (Q2491787) (← links)
- A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups (Q2496029) (← links)
- Batch scheduling and common due-date assignment on a single machine (Q2563922) (← links)
- Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues (Q2564877) (← links)
- Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups (Q2565776) (← links)
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems (Q2655646) (← links)
- Machine scheduling with job class setup and delivery considerations (Q2655964) (← links)
- Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
- On minimizing total tardiness in a serial batching problem (Q2765603) (← links)
- (Q2957491) (← links)
- Scheduling job shop problems with sequence-dependent setup times (Q3055268) (← links)
- Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
- Single machine scheduling to minimize the setup time and the earliness (Q3411902) (← links)
- The Batch Loading and Scheduling Problem (Q3634981) (← links)
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines (Q3636744) (← links)
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times (Q4286476) (← links)
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)
- Heuristic scheduling of parallel machines with sequence-dependent set-up times (Q4443334) (← links)
- Survey of scheduling research involving setup times (Q4546846) (← links)
- Scheduling with product family set-up times: an application in TFT LCD manufacturing (Q4671319) (← links)
- Minimizing <i>L</i> <sub>max</sub> for the single machine scheduling problem with family set-ups (Q4671323) (← links)
- Parallel Machine Scheduling with Batch Setup Times (Q4834072) (← links)
- (Q4934199) (← links)
- Analysis of batched service time data using Gaussian and semi-parametric kernel models (Q5036997) (← links)
- Single machine group scheduling with family setups to minimize total tardiness (Q5385473) (← links)
- Dynamic programming algorithms for scheduling parallel machines with family setup times (Q5926032) (← links)
- A heuristic approach for single-machine scheduling with due dates and class setups. (Q5945318) (← links)
- A note on the complexity of family scheduling to minimize the number of late jobs (Q5946721) (← links)
