Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
From MaRDI portal
Publication:5959375
DOI10.1016/S0305-0548(00)00086-1zbMath0999.68029MaRDI QIDQ5959375
Kunihiko Hiraishi, Eugene Levner, Milan Vlach
Publication date: 30 July 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Minimizing the weighted number of tardy jobs on multiple machines: a review, Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, Maximizing the weighted number of just-in-time jobs in flow shop scheduling, Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs, A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines, Fixed interval scheduling: models, applications, computational complexity and algorithms, Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs, A multi-objective optimization for preemptive identical parallel machines scheduling problem, Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines, Maximizing weighted number of just-in-time jobs on unrelated parallel machines, Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times, Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection, Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey, A note: maximizing the weighted number of just-in-time jobs for a given job sequence, The just-in-time scheduling problem in a flow-shop scheduling system, Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques, Earliness--tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming, Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems, A just-in-time scheduling problem with two competing agents, A survey of scheduling problems with setup times or costs, Two-agent single-machine scheduling problem with just-in-time jobs, Just-in-time scheduling with controllable processing times on parallel machines, Models and algorithms for energy-efficient scheduling with immediate start of jobs, Parallel flowshop scheduling using Tabu search
Cites Work
