A survey of scheduling problems with setup times or costs (Q2467249): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 19:58, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	A survey of scheduling problems with setup times or costs	scientific article

Statements

scholarly article

0 references

A survey of scheduling problems with setup times or costs (English)

0 references

0 references

European Journal of Operational Research

0 references

publication date

21 January 2008

0 references

full work available at URL

http://hdl.handle.net/10397/1269

0 references

zbMATH Keywords

scheduling

0 references

setup time

0 references

setup cost

0 references

survey (review)

0 references

single machine

0 references

parallel machines

0 references

flow shop

0 references

job shop

0 references

open shop

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Scheduling parallel machines with a single server: Some solvable cases and heuristics

0 references

Equal processing and equal setup time cases of scheduling parallel machines with a single server

0 references

Scheduling two parallel machines with a single server: the general case

0 references

An agent-based approach for scheduling multiple machines

0 references

Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests

0 references

A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times

0 references

Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm

0 references

Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment

0 references

Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times

0 references

Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times

0 references

Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

0 references

A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times

0 references

Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times

0 references

Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times

0 references

The significance of reducing setup times/setup costs

0 references

Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times

0 references

0 references

Group technology in a hybrid flowshop environment: a case study

0 references

Robust scheduling of parallel machines with sequence-dependent set-up costs

0 references

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis

0 references

Scheduling with shutdowns and sequence dependent set-up times

0 references

Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint

0 references

A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network

0 references

Scheduling job families about an unrestricted common due date on a single machine

0 references

Scheduling parallel machines to minimize weighted flowtime with family set-up times

0 references

0 references

Minimizing maximum lateness with job families

0 references

One-Operator, Two-Machine Open Shop And Flow Shop Scheduling With Setup Times For Machines And Maximum Lateness Objective

0 references

One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective

0 references

Early/tardy scheduling with sequence dependent setups on uniform parallel machines

0 references

Job shop scheduling with setup times, deadlines and precedence constraints

0 references

Batching identical jobs

0 references

On Minimizing Total Tardiness in a Serial Batching Problem

0 references

Scheduling a single machine to minimize a regular objective function under setup constraints

0 references

An integrated system solution for supply chain optimization in the chemical process industry

0 references

Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates

0 references

A tabu search algorithm for parallel machine total tardiness problem

0 references

The complexity of two group scheduling problems

0 references

Total flowtime and makespan for a no-wait <i>m</i>-machine flowshop with set-up times separated

0 references

Batch scheduling with deadlines on parallel machines

0 references

Complexity results for parallel machine problems with a single server

0 references

Complexity results for flow-shop problems with a single server

0 references

Exact algorithms for scheduling multiple families of jobs on parallel machines

0 references

Single machine scheduling with common due data assignment in a group technology environment

0 references

Parallel machine batching and scheduling with deadlines

0 references

Scheduling a single server in a two-machine flow shop

0 references

One-machine batching and sequencing of multiple-type items

0 references

One-operator-two-machine flowshop scheduling with setup and dismounting times

0 references

0 references

A note on the complexity of family scheduling to minimize the number of late jobs

0 references

Single machine batch scheduling with resource dependent setup and processing times

0 references

The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard

0 references

A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs

0 references

Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times

0 references

Production planning problems in printed circuit board assembly

0 references

0 references

Batch-processing scheduling with setup times

0 references

A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

0 references

Decomposition methods for reentrant flow shops with sequence-dependent setup times

0 references

A note on minimizing maximum lateness in a two-machine no-wait flowshop

0 references

Lot sizing and scheduling -- survey and extensions

0 references

A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines

0 references

Heuristic methods for the identical parallel machine flowtime problem with set-up times

0 references

Lower bounds and algorithms for flowtime minimization on a single machine with set-up times

0 references

Scheduling of wafer test processes in semiconductor manufacturing

0 references

A bicriteria scheduling with sequence-dependent setup times

0 references

Permutation flow shops with exact time lags to minimise maximum lateness

0 references

A memetic algorithm for the total tardiness single machine scheduling problem

0 references

Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times

0 references

On-line scheduling with setup costs

0 references

0 references

A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times

0 references

Scheduling multi-operation jobs on a single machine

0 references

Scheduling the production of two-component jobs on a single machine

0 references

Scheduling for parallel dedicated machines with a single server

0 references

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

0 references

Minimizing flow time in a flow-line manufacturing cell with family setup times

0 references

Algorithms for single machine total tardiness scheduling with sequence dependent setups

0 references

Parallel machine scheduling with a common server

0 references

Scheduling and lot streaming in flowshops with no-wait in process

0 references

Competitive online scheduling of perfectly malleable jobs with setup times

0 references

Minimizing the sum of job earliness and tardiness in a multimachine system

0 references

Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

0 references

Scheduling with batching: Two job types

0 references

A two-stage hybrid flowshop with uniform machines and setup times

0 references

List scheduling in a parallel machine environment with precedence constraints and setup times

0 references

Production sequencing problem with re-entrant work flows and sequence dependent setup times

0 references

Asymptotically optimal schedules for single-server flow shop problems with setup costs and times

0 references

Single machine group scheduling with resource dependent setup and processing times

0 references

Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups

0 references

Minimizing sum of completion times on a single machine with sequence-dependent family setup times

0 references

Two-machine shop scheduling problems with batch processing

0 references

A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots

0 references

An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups

0 references

Scheduling two parallel semiautomatic machines to minimize machine interference

0 references

Single-machine scheduling problems with past-sequence-dependent setup times

0 references

Batching decisions for assembly production systems

0 references

Parallel machine scheduling problems with a single server

0 references

A heuristic algorithm for minimizing mean flow time with unit setups

0 references

Heuristic scheduling of parallel machines with sequence-dependent set-up times

0 references

Scheduling flexible flow lines with sequence-dependent setup times

0 references

The vehicle routing problem: An overview of exact and approximate algorithms

0 references

Comparative analysis of order-input sequencing heuristics in a cellular flexible assembly system for large products

0 references

Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times

0 references

Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects

0 references

Fabrication scheduling on a single machine with due date constraints

0 references

Batch scheduling in the no-wait two-machine flowshop to minimize the makespan

0 references

Two-machine flowshop batching and scheduling

0 references

Scheduling with job release dates, delivery times and preemption penalties

0 references

Minimizing total completion time subject to job release dates and preemption penalties

0 references

Minimizing the number of late jobs under the group technology assumption

0 references

Scheduling groups of unit length jobs on two identical parallel machines.

0 references

Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

0 references

Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

0 references

A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops

0 references

Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times

0 references

A hybrid genetic algorithm for the single machine scheduling problem

0 references

A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs

0 references

A note on flow-shop and job-shop batch scheduling with identical processing-time jobs

0 references

A single machine batch scheduling problem with bounded batch size

0 references

Open-shop batch scheduling with identical jobs

0 references

Flow-shop batch scheduling with identical processing-time jobs

0 references

Minimizing flow-time on a single machine with integer batch sizes

0 references

Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock

0 references

A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

0 references

Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.

0 references

Batch scheduling with controllable setup and processing times to minimize total completion time

0 references

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.

0 references

Single machine batch scheduling with jointly compressible setup and processing times.

0 references

The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times

0 references

Group scheduling with controllable setup and processing times: minimizing total weighted completion time

0 references

A genetic algorithm methodology for complex scheduling problems

0 references

A heuristic approach for single-machine scheduling with due dates and class setups.

0 references

The wafer probing scheduling problem (WPSP)

0 references

Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions

0 references

Scheduling with batching: A review

0 references

Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.

0 references

A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

0 references

Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times

0 references

Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.

0 references

Heuristics and sequence-dependent set-up jobs in flow line cells

0 references

An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times

0 references

The flow shop scheduling polyhedron with setup times

0 references

Some effective heuristics for no-wait flowshops with setup times to minimize total completion time

0 references

A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility

0 references

Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics

0 references

Modeling realistic hybrid flexible flowshop scheduling problems

0 references

Single machine scheduling with family setups to minimize total earliness and tardiness

0 references

Scheduling a flowline manufacturing cell with sequence dependent family setup times

0 references

Minimizing <i>L</i> <sub>max</sub> for the single machine scheduling problem with family set-ups

0 references

0 references

A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups

0 references

Parallel machine scheduling with earliness and tardiness penalties

0 references

A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates

0 references

The CLWS heuristic for single machine scheduling problem

0 references

A cutting plane algorithm for a single machine scheduling problem

0 references

On the application of insertion techniques for job shop problems with setup times

0 references

Earliness-tardiness scheduling with setup considerations

0 references

Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

0 references

Two models for a family of flowshop sequencing problems

0 references

Group technology approach to the open shop scheduling problem with batch setup times

0 references

Scheduling problem in a two-machine flow line with the<i>N</i>-step prior-job-dependent set-up times

0 references

Non-approximability of precedence-constrained sequencing to minimize setups.

0 references

Two MILP models for the N × M SDST flowshop sequencing problem

0 references

A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times

0 references

A tabu search approach to machine scheduling

0 references

Sequencing jobs that require common resources on a single machine: A solvable case of the TSP

0 references

The scheduling problem of PCBs for multiple non-identical parallel machines

0 references

Stochastic sequencing with job families, set-up times, and due dates

0 references

Analytical models to predict the performance of a single-machine system under periodic and event-driven rescheduling strategies

0 references

Improved dynamic programs for some batching problems involving the maximum lateness criterion

0 references

An approximation algorithm for parallel machine scheduling with a common server

0 references

Two-machine flowshop scheduling with job class setups to minimize total flowtime

0 references

A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups

0 references

Dynamic programming algorithms for scheduling parallel machines with family setup times

0 references

A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date

0 references

A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times

0 references

Parallel machine scheduling with splitting jobs

0 references

Optimal scheduling of two-component products on a single facility

0 references

Learning and forgetting effects on a group scheduling problem

0 references

Two-machine flowshop group scheduling problem

0 references

Survey of scheduling research involving setup times

0 references

Flow-shop scheduling with setup and assembly operations

0 references

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times

0 references

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

0 references

An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times

0 references

Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.EJOR.2006.06.060

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2467249

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2467249&oldid=39103025"