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

DOI10.1016/S0377-2217(97)00098-2zbMath0951.90025OpenAlexW1987889641MaRDI QIDQ1296704

V. Pereyra

Publication date: 2 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00098-2

zbMATH Keywords

tabu searchjob sequencingjust-in-time productionneighbourhood generationvariable processing time

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ A survey of scheduling problems with setup times or costs

Cites Work

• Unnamed Item
• Survey of scheduling research involving due date determination decisions
• Sequencing jobs on a single machine with a common due data and stochastic processing times
• Restricted neighborhood in the tabu search for the flowshop problem
• Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
• Simulated annealing and tabu search: Lessons from a line search
• Tabu search performance on the symmetric travelling salesman problem
• Applying tabu search with influential diversification to multiprocessor scheduling
• Generalized pairwise interchanges and machine scheduling
• Future paths for integer programming and links to artificial intelligence
• Sequencing with Earliness and Tardiness Penalties: A Review
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule

This page was built for publication: An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups