Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times

DOI10.1007/s10951-013-0327-zzbMath1297.90054OpenAlexW2006776668MaRDI QIDQ398882

Gur Mosheiov, Dvir Shabtay

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0327-z

zbMATH Keywords

learning effectaging effectposition-dependent processing timesjust-in-time scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs ⋮ A note: maximizing the weighted number of just-in-time jobs for a given job sequence ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach

Cites Work

• Unnamed Item
• Unnamed Item
• The just-in-time scheduling problem in a flow-shop scheduling system
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• Scheduling jobs with fixed start and end times
• Single-machine scheduling with learning considerations
• Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
• On the \(k\)-coloring of intervals
• Single machine scheduling to minimize the number of early and tardy jobs
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
• Interval scheduling on identical machines
• Sequencing with Earliness and Tardiness Penalties: A Review
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Due-window assignment with unit processing-time jobs
• Parallel machine scheduling with a learning effect
• Scheduling jobs with position-dependent processing times
• Note on scheduling with general learning curves to minimize the number of tardy jobs
• Parallel machine scheduling with common due windows
• Scheduling jobs under an aging effect
• Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
• Parallel Processing and Applied Mathematics
• Single-machine scheduling with a common due window
• Parallel machine scheduling with a common due window
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

This page was built for publication: Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times