A survey of scheduling problems with setup times or costs
From MaRDI portal
Publication:2467249
Recommendations
Cites work
- scientific article; zbMATH DE number 5151911 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1305470 (Why is no real title available?)
- scientific article; zbMATH DE number 1389747 (Why is no real title available?)
- scientific article; zbMATH DE number 1416517 (Why is no real title available?)
- scientific article; zbMATH DE number 1437089 (Why is no real title available?)
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- A bicriteria scheduling with sequence-dependent setup times
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- A cutting plane algorithm for a single machine scheduling problem
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
- A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
- A genetic algorithm methodology for complex scheduling problems
- A heuristic algorithm for minimizing mean flow time with unit setups
- A heuristic approach for single-machine scheduling with due dates and class setups.
- A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
- A hybrid genetic algorithm for the single machine scheduling problem
- A memetic algorithm for the total tardiness single machine scheduling problem
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- A note on minimizing maximum lateness in a two-machine no-wait flowshop
- A note on the complexity of family scheduling to minimize the number of late jobs
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
- A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
- A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
- A single machine batch scheduling problem with bounded batch size
- A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
- A tabu search algorithm for parallel machine total tardiness problem
- A tabu search approach to machine scheduling
- A two-stage hybrid flowshop with uniform machines and setup times
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
- An agent-based approach for scheduling multiple machines
- An approximation algorithm for parallel machine scheduling with a common server
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- An integrated system solution for supply chain optimization in the chemical process industry
- Analytical models to predict the performance of a single-machine system under periodic and event-driven rescheduling strategies
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Batch scheduling with controllable setup and processing times to minimize total completion time
- Batch scheduling with deadlines on parallel machines
- Batch-processing scheduling with setup times
- Batching decisions for assembly production systems
- Batching identical jobs
- Comparative analysis of order-input sequencing heuristics in a cellular flexible assembly system for large products
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- Competitive online scheduling of perfectly malleable jobs with setup times
- Complexity results for flow-shop problems with a single server
- Complexity results for parallel machine problems with a single server
- Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups
- Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
- Earliness-tardiness scheduling with setup considerations
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Fabrication scheduling on a single machine with due date constraints
- Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates
- Flow-shop batch scheduling with identical processing-time jobs
- Flow-shop scheduling with setup and assembly operations
- Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Group technology approach to the open shop scheduling problem with batch setup times
- Group technology in a hybrid flowshop environment: a case study
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- Heuristics and sequence-dependent set-up jobs in flow line cells
- Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
- Improved dynamic programs for some batching problems involving the maximum lateness criterion
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Job shop scheduling with setup times, deadlines and precedence constraints
- Learning and forgetting effects on a group scheduling problem
- List scheduling in a parallel machine environment with precedence constraints and setup times
- Lot sizing and scheduling -- survey and extensions
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- Minimizing L max for the single machine scheduling problem with family set-ups
- Minimizing flow time in a flow-line manufacturing cell with family setup times
- Minimizing flow-time on a single machine with integer batch sizes
- Minimizing maximum lateness with job families
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Minimizing sum of completion times on a single machine with sequence-dependent family setup times
- Minimizing the number of late jobs under the group technology assumption
- Minimizing the sum of job earliness and tardiness in a multimachine system
- Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
- Minimizing total completion time subject to job release dates and preemption penalties
- Modeling realistic hybrid flexible flowshop scheduling problems
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- Non-approximability of precedence-constrained sequencing to minimize setups.
- On minimizing total tardiness in a serial batching problem
- On the application of insertion techniques for job shop problems with setup times
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
- On-line scheduling with setup costs
- One-Operator, Two-Machine Open Shop And Flow Shop Scheduling With Setup Times For Machines And Maximum Lateness Objective
- One-machine batching and sequencing of multiple-type items
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
- One-operator-two-machine flowshop scheduling with setup and dismounting times
- Open-shop batch scheduling with identical jobs
- Optimal scheduling of two-component products on a single facility
- Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine batching and scheduling with deadlines
- Parallel machine scheduling by family batching with sequence-independent set-up times
- Parallel machine scheduling problems with a single server
- Parallel machine scheduling with a common server
- Parallel machine scheduling with earliness and tardiness penalties
- Parallel machine scheduling with splitting jobs
- Permutation flow shops with exact time lags to minimise maximum lateness
- Production planning problems in printed circuit board assembly
- Production sequencing problem with re-entrant work flows and sequence dependent setup times
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Scheduling a single server in a two-machine flow shop
- Scheduling and lot streaming in flowshops with no-wait in process
- Scheduling batches with sequential job processing for two-machine flow and open shops
- Scheduling flexible flow lines with sequence-dependent setup times
- Scheduling for parallel dedicated machines with a single server
- Scheduling groups of unit length jobs on two identical parallel machines.
- Scheduling job families about an unrestricted common due date on a single machine
- Scheduling multi-operation jobs on a single machine
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Scheduling of wafer test processes in semiconductor manufacturing
- Scheduling parallel machines to minimize weighted flowtime with family set-up times
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
- Scheduling problem in a two-machine flow line with theN-step prior-job-dependent set-up times
- Scheduling the production of two-component jobs on a single machine
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Scheduling two parallel machines with a single server: the general case
- Scheduling two parallel semiautomatic machines to minimize machine interference
- Scheduling with batching: A review
- Scheduling with batching: Two job types
- Scheduling with job release dates, delivery times and preemption penalties
- Scheduling with shutdowns and sequence dependent set-up times
- Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan
- Single machine batch scheduling with jointly compressible setup and processing times.
- Single machine batch scheduling with resource dependent setup and processing times
- Single machine group scheduling with resource dependent setup and processing times
- Single machine scheduling with common due data assignment in a group technology environment
- Single machine scheduling with family setups to minimize total earliness and tardiness
- Single-machine scheduling problems with past-sequence-dependent setup times
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Stochastic sequencing with job families, set-up times, and due dates
- Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
- Survey of scheduling research involving setup times
- Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times
- The CLWS heuristic for single machine scheduling problem
- The complexity of two group scheduling problems
- The flow shop scheduling polyhedron with setup times
- The scheduling problem of PCBs for multiple non-identical parallel machines
- The significance of reducing setup times/setup costs
- The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
- The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
- The vehicle routing problem: An overview of exact and approximate algorithms
- The wafer probing scheduling problem (WPSP)
- Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
- Two MILP models for the N × M SDST flowshop sequencing problem
- Two models for a family of flowshop sequencing problems
- Two-machine flowshop batching and scheduling
- Two-machine flowshop group scheduling problem
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
- Two-machine shop scheduling problems with batch processing
- Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests
- Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
Cited in
(only showing first 100 items - show all)- Minimizing total tardiness in no-wait flowshops
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- Flow shop batching and scheduling with sequence-dependent setup times
- Batch scheduling in a two-stage flexible flow shop problem
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- Exact method for the two-machine flow-shop problem with time delays
- Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
- A batch scheduling problem with two agents
- Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
- Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
- Parameterized complexity of machine scheduling: 15 open problems
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- Batch scheduling on uniform machines to minimize total flow-time
- Multi-product lot-sizing and sequencing on a single imperfect machine
- Sequencing and scheduling for filling lines in dairy production
- Survey of scheduling research involving setup times
- Semiconductor final-test scheduling under setup operator constraints
- Single machine batch scheduling with release times and delivery costs
- Lot scheduling on a single machine
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- On competitive analysis for polling systems
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
- Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- On-line machine scheduling with batch setups
- Batch scheduling on two-machine flowshop with machine-dependent setup times
- Single-machine batch scheduling of linear deteriorating jobs
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Lot-Sizing and Sequencing on a Single Imperfect Machine
- scientific article; zbMATH DE number 7559087 (Why is no real title available?)
- Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
- Competitive online scheduling of perfectly malleable jobs with setup times
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
- Batch scheduling of step deteriorating jobs
- Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- Equilibrium customer strategies in the queue with threshold policy and setup times
- Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
- Scheduling algorithms for a semiconductor probing facility
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
- Cost-based decision-making in middleware virtualization environments
- Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
- Completing partial schedules for open shop with unit processing times and routing
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- Scheduling results applicable to decision-theoretic troubleshooting
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
- Parallel machine scheduling with preference of machines
- A mathematical model for the management of a service center
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
- Learning and forgetting effects on a group scheduling problem
- Single-machine scheduling problems with past-sequence-dependent setup times
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
- Multi-family scheduling in a two-machine reentrant flow shop with setups
- Single-job lot streaming in \(m - 1\) two-stage hybrid flowshops
- Single item lot-sizing problem for a warm/cold process with immediate lost sales
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- Scheduling job shop problems with sequence-dependent setup times
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- Parallel machines scheduling with machine preference via agent-based approach
- A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem
- An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- Batching deteriorating items with applications in computer communication and reverse logistics
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
- Scheduling batches in flowshop with limited buffers in the shampoo industry
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Single machine batch scheduling with two competing agents to minimize total flowtime
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
- Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
- Modeling job shop scheduling with batches and setup times by timed Petri nets
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects
- A single machine batch scheduling problem with bounded batch size
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
This page was built for publication: A survey of scheduling problems with setup times or costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467249)
