A note: maximizing the weighted number of just-in-time jobs for a given job sequence
From MaRDI portal
Publication:6136084
DOI10.1007/s10951-022-00772-4zbMath1520.90104OpenAlexW4318003442MaRDI QIDQ6136084
Publication date: 28 August 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-022-00772-4
Cites Work
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
- The just-in-time scheduling problem in a flow-shop scheduling system
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- 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
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine
- Single machine scheduling to minimize mean absolute lateness: A heuristic solution
- Single machine scheduling to minimize the number of early and tardy jobs
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The open shop scheduling problem with a given sequence of jobs on one machine
- Reducibility among Combinatorial Problems
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
This page was built for publication: A note: maximizing the weighted number of just-in-time jobs for a given job sequence
